Systems and methods for synchronization within a neighborhood aware network

ABSTRACT

Methods, devices, and computer program products for synchronization of wireless devices in a peer-to-peer network are described herein. In one aspect, a method for synchronizing a wireless communication apparatus is provided. The method includes receiving one or more synchronization messages, each synchronization message having timing information and a cluster identifier, the timing information comprising anchor timing information, the cluster identifier being the same value as a cluster identifier of the apparatus. The method further includes determining whether a difference between a time value when a received synchronization message last received anchor timing information and a time value maintained for the apparatus is greater than a threshold. The method further includes discarding the received synchronization message if the difference exceeds the threshold.

CROSS REFERENCE TO RELATED APPLICATIONS

This application claims priority under 35 U.S.C. §119(e) to U.S.Provisional Patent Application No. 61/805,858 entitled “SYSTEMS ANDMETHODS FOR SYNCHRONIZATION WITHIN A NEIGHBORHOOD AWARE NETWORK” filedon Mar. 27, 2013 the disclosure of which is hereby incorporated byreference in its entirety. The present application further claimspriority to U.S. Provisional Patent Application No. 61/810,203 entitled“SYSTEMS AND METHODS FOR SYNCHRONIZATION WITHIN A NEIGHBORHOOD AWARENETWORK” filed on Apr. 9, 2013 the disclosure of which is herebyincorporated by reference in its entirety. The present applicationfurther claims priority to U.S. Provisional Patent Application No.61/819,112 entitled “SYSTEMS AND METHODS FOR SYNCHRONIZATION WITHIN ANEIGHBORHOOD AWARE NETWORK” filed on May 3, 2013 the disclosure of whichis hereby incorporated by reference in its entirety. The presentapplication further claims priority to U.S. Provisional PatentApplication No. 61/832,706 entitled “SYSTEMS AND METHODS FORSYNCHRONIZATION WITHIN A NEIGHBORHOOD AWARE NETWORK” filed on Jun. 7,2013 the disclosure of which is hereby incorporated by reference in itsentirety. The present application further claims priority to U.S.Provisional Patent Application No. 61/833,883 entitled “SYSTEMS ANDMETHODS FOR SYNCHRONIZATION WITHIN A NEIGHBORHOOD AWARE NETWORK” filedon Jun. 11, 2013 the disclosure of which is hereby incorporated byreference in its entirety. The present application further claimspriority to U.S. Provisional Patent Application No. 61/859,668 entitled“SYSTEMS AND METHODS FOR SYNCHRONIZATION WITHIN A NEIGHBORHOOD AWARENETWORK” filed on Jul. 29, 2013 the disclosure of which is herebyincorporated by reference in its entirety. The present applicationfurther claims priority to U.S. Provisional Patent Application No.61/866,423 entitled “SYSTEMS AND METHODS FOR SYNCHRONIZATION WITHIN ANEIGHBORHOOD AWARE NETWORK” filed on Aug. 15, 2013 the disclosure ofwhich is hereby incorporated by reference in its entirety. The presentapplication further claims priority to U.S. Provisional PatentApplication No. 61/888,396 entitled “SYSTEMS AND METHODS FORSYNCHRONIZATION WITHIN A NEIGHBORHOOD AWARE NETWORK” filed on Oct. 8,2013 the disclosure of which is hereby incorporated by reference in itsentirety.

BACKGROUND

1. Field

The present application relates generally to wireless communications,and more specifically to systems, methods, and devices forsynchronization in a peer-to-peer wireless network.

2. Background

In many telecommunication systems, communications networks are used toexchange messages among several interacting spatially-separated devices.Networks can be classified according to geographic scope, which couldbe, for example, a metropolitan area, a local area, or a personal area.Such networks would be designated respectively as a wide area network(WAN), metropolitan area network (MAN), local area network (LAN),wireless local area network (WLAN), a neighborhood aware network (NAN),or personal area network (PAN). Networks also differ according to theswitching/routing technique used to interconnect the various networknodes and devices (e.g. circuit switching vs. packet switching), thetype of physical media employed for transmission (e.g. wired vs.wireless), and the set of communication protocols used (e.g., Internetprotocol suite, SONET (Synchronous Optical Networking), Ethernet, etc.).

Wireless networks are often preferred when the network elements aremobile and thus have dynamic connectivity needs, or if the networkarchitecture is formed in an ad hoc, rather than fixed, topology.Wireless networks employ intangible physical media in an unguidedpropagation mode using electromagnetic waves in the radio, microwave,infra-red, optical, etc. frequency bands. Wireless networksadvantageously facilitate user mobility and rapid field deployment whencompared to fixed wired networks.

Devices in a wireless network can transmit and/or receive information toand from each other. To carry out various communications, the devicescan coordinate according to a protocol. As such, devices can exchangeinformation to coordinate their activities. Improved systems, methods,and devices for coordinating transmitting and sending communicationswithin a wireless network are desired.

SUMMARY

The systems, methods, devices, and computer program products discussedherein each have several aspects, no single one of which is solelyresponsible for its desirable attributes. Without limiting the scope ofthis invention as expressed by the claims which follow, some featuresare discussed briefly below. After considering this discussion, andparticularly after reading the section entitled “Detailed Description,”it will be understood how advantageous features of this inventioninclude reduced power consumption when introducing devices on a medium.

One aspect of the disclosure provides a method of synchronizing awireless communication apparatus. The method includes receiving one ormore synchronization messages, each synchronization message havingtiming information. The method further includes selectively updating atime value based on the timing information in the receivedsynchronization messages.

Another aspect of the subject matter described in the disclosureprovides a wireless communication apparatus configured for wirelessnetwork synchronization. The apparatus includes a receiver configured toreceive one or more synchronization messages, each synchronizationmessage having timing information. The apparatus further includes aprocessor configured to selectively update a time value based on thetiming information in the received synchronization messages.

Another aspect of the subject matter described in the disclosureprovides a wireless communication apparatus configured for wirelessnetwork synchronization. The apparatus includes means for receiving oneor more synchronization messages, each synchronization message havingtiming information. The apparatus further includes means for selectivelyupdating a time value based on the timing information in the receivedsynchronization messages.

Another aspect of the disclosure provides a non-transitorycomputer-readable medium comprising code. The code, when executed,causes a processor to receive one or more synchronization messages, eachsynchronization message having timing information. The code furthercauses the processor to selectively update a time value based on thetiming information in the received synchronization messages.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A illustrates an example of a wireless communication system.

FIG. 1B illustrates another example of a wireless communication system.

FIG. 2 illustrates a functional block diagram of a wireless device thatcan be employed within the wireless communication system of FIG. 1.

FIG. 3 illustrates an example of a communication system in which aspectsof the present disclosure can be employed.

FIG. 4 illustrates an exemplary discovery window structure for an STA tocommunicate with an AP to discover a NAN in accordance with an exemplaryimplementation of the invention.

FIG. 5A shows an exemplary structure of a media access control (MAC)frame.

FIG. 5B shows an exemplary structure of a master preference value (MPV).

FIG. 5C shows another exemplary structure of a master preference value(MPV).

FIG. 6A shows an exemplary attribute of a NAN information element (IE)that can be employed within the NAN of FIG. 3.

FIG. 6B shows another exemplary attribute of a NAN information element(IE) that can be employed within the NAN of FIG. 3.

FIG. 7 is a timing diagram illustrating one embodiment of a beaconwindow, discovery query window, and discovery query response window.

FIG. 8 is a timing diagram illustrating one embodiment of a beaconwindow, discovery query window, and discovery query response window.

FIG. 9 is a timing diagram illustrating one embodiment of a beaconwindow, discovery query window, and discovery query response window.

FIG. 10 illustrates a message that can include a time value forsynchronization.

FIG. 11 shows a flowchart of a method of transmitting and receiving asynchronization frame in accordance with an embodiment.

FIG. 12 shows a flowchart of a method of transmitting a synchronizationframe in accordance with an embodiment.

FIG. 13 shows a flowchart for an exemplary method of wirelesscommunication that can be employed within the wireless communicationsystem of FIG. 1.

FIG. 14 is a timeline showing two discovery windows separated by adiscovery period.

FIG. 15 is a timeline showing the portion of the timeline of FIG. 14associated with the second discovery window with a first implementationof transition timing from a low power sleep mode to a higher poweractive mode for a networked wireless communication device.

FIG. 16 is a timeline showing the portion of the timeline of FIG. 14associated with the second discovery window with a second implementationof transition timing from a low power sleep mode to a higher poweractive mode for a networked wireless communication device.

DETAILED DESCRIPTION

The word “exemplary” is used herein to mean “serving as an example,instance, or illustration.” Any embodiment described herein as“exemplary” is not necessarily to be construed as preferred oradvantageous over other embodiments. Various aspects of the novelsystems, apparatuses, and methods are described more fully hereinafterwith reference to the accompanying drawings. This disclosure can,however, be embodied in many different forms and should not be construedas limited to any specific structure or function presented throughoutthis disclosure. Rather, these aspects are provided so that thisdisclosure will be thorough and complete, and will fully convey thescope of the disclosure to those skilled in the art. Based on theteachings herein one skilled in the art should appreciate that the scopeof the disclosure is intended to cover any aspect of the novel systems,apparatuses, and methods disclosed herein, whether implementedindependently of, or combined with, any other aspect of the invention.For example, an apparatus can be implemented or a method can bepracticed using any number of the aspects set forth herein. In addition,the scope of the invention is intended to cover such an apparatus ormethod which is practiced using other structure, functionality, orstructure and functionality in addition to or other than the variousaspects of the invention set forth herein. It should be understood thatany aspect disclosed herein can be embodied by one or more elements of aclaim.

Although particular aspects are described herein, many variations andpermutations of these aspects fall within the scope of the disclosure.Although some benefits and advantages of the preferred aspects arementioned, the scope of the disclosure is not intended to be limited toparticular benefits, uses, or objectives. Rather, aspects of thedisclosure are intended to be broadly applicable to different wirelesstechnologies, system configurations, networks, and transmissionprotocols, some of which are illustrated by way of example in thefigures and in the following description of the preferred aspects. Thedetailed description and drawings are merely illustrative of thedisclosure rather than limiting, the scope of the disclosure beingdefined by the appended claims and equivalents thereof.

Wireless network technologies can include various types of wirelesslocal area networks (WLANs). A WLAN can be used to interconnect nearbydevices together, employing widely used networking protocols. However,the various aspects described herein can apply to any communicationstandard, such as a wireless protocol.

In some implementations, a WLAN includes various devices which are thecomponents that access the wireless network. For example, there can betwo types of devices: access points (“APs”) and clients (also referredto as stations, or “STAs”). In general, an AP can serve as a hub or basestation for the WLAN and a STA serves as a user of the WLAN. Forexample, a STA can be a laptop computer, a personal digital assistant(PDA), a mobile phone, etc. In an example, a STA connects to an AP via aWi-Fi (e.g., IEEE 802.11 protocol) compliant wireless link to obtaingeneral connectivity to the Internet or to other wide area networks. Insome implementations a STA can also be used as an AP.

An access point (“AP”) can also include, be implemented as, or known asa NodeB, Radio Network Controller (“RNC”), eNodeB, Base StationController (“BSC”), Base Transceiver Station (“BTS”), Base Station(“BS”), Transceiver Function (“TF”), Radio Router, Radio Transceiver, orsome other terminology.

A station “STA” can also include, be implemented as, or known as anaccess terminal (“AT”), a subscriber station, a subscriber unit, amobile station, a remote station, a remote terminal, a user terminal, auser agent, a user device, user equipment, or some other terminology. Insome implementations an access terminal can include a cellulartelephone, a cordless telephone, a Session Initiation Protocol (“SIP”)phone, a wireless local loop (“WLL”) station, a personal digitalassistant (“PDA”), a handheld device having wireless connectioncapability, or some other suitable processing device or wireless deviceconnected to a wireless modem. Accordingly, one or more aspects taughtherein can be incorporated into a phone (e.g., a cellular phone orsmartphone), a computer (e.g., a laptop), a portable communicationdevice, a headset, a portable computing device (e.g., a personal dataassistant), an entertainment device (e.g., a music or video device, or asatellite radio), a gaming device or system, a global positioning systemdevice, or any other suitable device that is configured to communicatevia a wireless medium.

As discussed above, one or more nodes of a peer-to-peer network cantransmit synchronization messages to coordinate one or more availabilitywindows for communication between nodes of the peer-to-peer network. Thenodes can also exchange discovery queries and responses to provide forservice discovery between devices operating within the same peer-to-peeror neighborhood aware network. A neighborhood aware network can beconsidered a peer-to-peer network or an ad-hoc network in some aspects.The nodes repeatedly wake from a sleep state to periodically transmitand/or receive synchronization messages and discovery messages. It wouldbe advantageous if the nodes 106 were able to stay longer in a sleepstate to conserve power and not wake from the sleep state to transmitand/or receive synchronization messages on the network. In addition, thetransmission and retransmissions of synchronization and discoverymessages by the nodes 106 can introduce a large amount of unnecessaryoverhead to the network

In some embodiments, only a subset of nodes can be configured totransmit synchronization messages, for example, in order to reducenetwork congestion. In some embodiments, a subset of nodes can bedesignated or elected “master” nodes. For example, nodes that haveaccess to an external power source can be elected as master nodes,whereas nodes that run on battery power may not. In various embodiments,nodes can be designated as one or more different types of master nodesincluding: discovery master nodes, synchronization master nodes, and/oranchor master nodes.

In some embodiments, one or more discovery master nodes can transmit NANdiscovery messages, while other nodes may not. For example, discoverymaster nodes can be configured to transmit beacons outside of adiscovery window. In some embodiments, one or more synchronizationmaster nodes can transmit synchronization messages, while other nodesmay not. For example, synchronization master nodes can be configured totransmit beacons within the discovery window.

In some embodiments, one or more anchor master nodes can bepreferentially elected as synchronization master nodes and/or discoverymaster nodes. Anchor nodes can be preset, elected as described hereinwith respect to master node election, or determined in another manner.NANs having an anchor node can be referred to as anchored NANs and NANshaving no anchor node can be referred to as non-anchored NANs.

In some embodiments, one or more nodes in a NAN can elect one or moremaster nodes based on a dynamically determined or preset masterpreference value (MPV). For example, nodes with access to an externalpower source can set their MPV higher (e.g., 10), whereas nodes onbattery power can set their MPV lower (e.g., 5). During the electionprocess, nodes having a higher MPV can be more likely to be electedmaster nodes. In some embodiments, anchor nodes can have a higher MPVthan non-anchor nodes, and thus can be more likely to be elected asmaster nodes.

In some cases, a master node election process can cause unfairnessamongst the nodes. For example, master nodes can consume more powerand/or processor resources than non-master nodes. In certainimplementations, master nodes can become “locked in” as master nodes,with little or no opportunity to pass on the responsibility oftransmitting synchronization messages to other nodes. Moreover, one ormore nodes in the NAN may not support the master node election process.In some embodiments, nodes that do not support the master node electionprocess can set their MPV to a predetermined or minimum value.Accordingly, it can be beneficial for some nodes to adopt an inclusive,MPV-compatible, synchronization transmission process.

FIG. 1A illustrates an example of a wireless communication system 100.The wireless communication system 100 can operate pursuant to a wirelessstandard, such as an 802.11 standard. The wireless communication system100 can include an AP 104, which communicates with STAs. In someaspects, the wireless communication system 100 can include more than oneAP. Additionally, the STAs can communicate with other STAs. As anexample, a first STA 106 a can communicate with a second STA 106 b. Asanother example, a first STA 106 a can communicate with a third STA 106c although this communication link is not illustrated in FIG. 1A.

A variety of processes and methods can be used for transmissions in thewireless communication system 100 between the AP 104 and the STAs andbetween an individual STA, such as the first STA 106 a, and anotherindividual STA, such as the second STA 106 b. For example, signals canbe sent and received in accordance with OFDM/OFDMA techniques. If thisis the case, the wireless communication system 100 can be referred to asan OFDM/OFDMA system. Alternatively, signals can be sent and receivedbetween the AP 104 and the STAs and between an individual STA, such asthe first STA 106 a, and another individual STA, such as the second STA106 b, in accordance with CDMA techniques. If this is the case, thewireless communication system 100 can be referred to as a CDMA system.

A communication link can be established between STAs. Some possiblecommunication links between STAs are illustrated in FIG. 1A. As anexample, a communication link 112 can facilitate transmission from thefirst STA 106 a to the second STA 106 b. Another communication link 114can facilitate transmission from the second STA 106 b to the first STA106 a.

The AP 104 can act as a base station and provide wireless communicationcoverage in a basic service area (BSA) 102. The AP 104 along with theSTAs associated with the AP 104 and that use the AP 104 forcommunication can be referred to as a basic service set (BSS).

It should be noted that the wireless communication system 100 may nothave a central AP 104, but rather can function as a peer-to-peer networkbetween the STAs. Accordingly, the functions of the AP 104 describedherein can alternatively be performed by one or more of the STAs.

FIG. 1B illustrates an example of a wireless communication system 160that can function as a peer-to-peer network. For example, the wirelesscommunication system 160 in FIG. 1B shows STAs 106 a-106 i that cancommunicate with each other without the presence of an AP. As such, theSTAs, 106 a-106 i can be configured to communicate in different ways tocoordinate transmission and reception of messages to preventinterference and accomplish various tasks. In one aspect, the networksshown in FIG. 1B can be configured as a “neighborhood aware networking”(NAN). In one aspect, a NAN can refer to a network for communicationbetween STAs that are located in close proximity to each other. In somecases the STAs operating within the NAN can belong to different networkstructures (e.g., STAs in different homes or buildings as part ofindependent LANs with different external network connections).

In some aspects, a communication protocol used for communication betweennodes on the peer-to-peer communications network 160 can scheduleperiods of time during which communication between network nodes canoccur. These periods of time when communication occurs between STAs 106a-106 i can be known as availability windows. An availability window caninclude a discovery interval or paging interval as discussed furtherbelow.

The protocol can also define other periods of time when no communicationbetween nodes of the network is to occur. In some embodiments, nodes canenter one or more sleep states when the peer-to-peer network 160 is notin an availability window. Alternatively, in some embodiments, portionsof the stations 106 a-106 i can enter a sleep state when thepeer-to-peer network is not in an availability window. For example, somestations can include networking hardware that enters a sleep state whenthe peer-to-peer network is not in an availability window, while otherhardware included in the STA, for example, a processor, an electronicdisplay, or the like do not enter a sleep state when the peer-to-peernetwork is not in an availability window.

The peer-to-peer communication network 160 can assign one nodes to be aroot node, or can assign one or more nodes to be master nodes. In FIG.1B, the assigned root node is shown as STA 106 e. In peer-to-peernetwork 160, the root node is responsible for periodically transmittingsynchronization signals to other nodes in the peer-to-peer network. Thesynchronization signals transmitted by root node 160 e can provide atiming reference for other nodes 106 a-d and 106 f-i to coordinate anavailability window during which communication occurs between the nodes.For example, a synchronization message 172 a-172 d can be transmitted byroot node 106 e and received by nodes 106 b-106 c and 106 f-106 g. Thesynchronization message 172 can provide a timing source for the STAs 106b-c and 106 f-106 g. The synchronization message 172 can also provideupdates to a schedule for future availability windows. Thesynchronization messages 172 can also function to notify STAs 106 b-106c and 106 f-106 g that they are still present in the peer-to-peernetwork 160.

Some of the nodes in the peer-to-peer communication network 160 canfunction as branch synchronization nodes. A branch synchronization nodecan retransmit both availability window schedule and master clockinformation received from a root node. In some embodiments,synchronization messages transmitted by a root node can includeavailability window schedule and master clock information. In theseembodiments, the synchronization messages can be retransmitted by thebranch synchronization nodes. In FIG. 1B, STAs 106 b-106 c and 106 f-106g are shown functioning as branch-synchronization nodes in thepeer-to-peer communication network 160. STAs 106 b-106 c and 106 f-106 greceive the synchronization message 172 a-172 d from root node 106 e andretransmit the synchronization message as retransmitted synchronizationmessages 174 a-174 d. By retransmitting the synchronization message 172from root node 106 e, the branch synchronization nodes 106 b-106 c and106 f-106 g can extend the range and improve the robustness of thepeer-to-peer network 160.

The retransmitted synchronization messages 174 a-174 d are received bynodes 106 a, 106 d, 106 h, and 106 i. These nodes can be characterizedas “leaf” nodes, in that they do not retransmit the synchronizationmessage they receive from either the root node 106 e or the branchsynchronization nodes 106 b-106 c or 106 f-106 g. In some embodiments, aplurality of nodes can negotiate transmission of synchronization signalsas discussed in greater detail herein.

Synchronization messages, or synchronization frames, can be transmittedperiodically. However, periodic transmission of synchronization messagescan be problematic for the nodes 106. These problems can be caused bythe nodes 106 having to repeatedly wake from a sleep state toperiodically transmit and/or receive synchronization messages. It wouldbe advantageous if the nodes 106 were able to stay longer in a sleepstate to conserve power and not wake from the sleep state to transmitand/or receive synchronization messages on the network.

When a new wireless device enters a location with a NAN, the wirelessdevice can scan the airwaves for discovery and synchronizationinformation before joining the NAN. It would be advantageous if theinformation necessary for the STA to join the NAN was quickly accessibleto the STA.

In addition, the transmission and retransmissions of synchronizationand/or discovery messages by the nodes 106 within a NAN can introduce alarge amount of unnecessary overhead to the network.

FIG. 2 illustrates various components that can be utilized in a wirelessdevice 202 that can be employed within the wireless communication system100 or 160. The wireless device 202 is an example of a device that canbe configured to implement the various methods described herein. Forexample, the wireless device 202 can include the AP 104 or one of theSTAs.

The wireless device 202 can include a processor 204 which controlsoperation of the wireless device 202. The processor 204 can also bereferred to as a central processing unit (CPU). Memory 206, which caninclude both read-only memory (ROM) and random access memory (RAM), canprovide instructions and data to the processor 204. A portion of thememory 206 can also include non-volatile random access memory (NVRAM).The processor 204 typically performs logical and arithmetic operationsbased on program instructions stored within the memory 206. Theinstructions in the memory 206 can be executable to implement themethods described herein.

The processor 204 can include or be a component of a processing systemimplemented with one or more processors. The one or more processors canbe implemented with any combination of general-purpose microprocessors,microcontrollers, digital signal processors (DSPs), field programmablegate array (FPGAs), programmable logic devices (PLDs), controllers,state machines, gated logic, discrete hardware components, dedicatedhardware finite state machines, or any other suitable entities that canperform calculations or other manipulations of information.

The processing system can also include machine-readable media forstoring software. Software shall be construed broadly to mean any typeof instructions, whether referred to as software, firmware, middleware,microcode, hardware description language, or otherwise. Instructions caninclude code (e.g., in source code format, binary code format,executable code format, or any other suitable format of code). Theinstructions, when executed by the one or more processors, cause theprocessing system to perform the various functions described herein.

The wireless device 202 can also include a housing 208 that can includea transmitter 210 and/or a receiver 212 to allow transmission andreception of data between the wireless device 202 and a remote location.The transmitter 210 and receiver 212 can be combined into a transceiver214. An antenna 216 can be attached to the housing 208 and electricallycoupled to the transceiver 214. The wireless device 202 can also include(not shown) multiple transmitters, multiple receivers, multipletransceivers, and/or multiple antennas.

The transmitter 210 can be configured to wirelessly transmit packetshaving different packet types or functions. For example, the transmitter210 can be configured to transmit packets of different types generatedby the processor 204. When the wireless device 202 is implemented orused as an AP 104 or STA 106, the processor 204 can be configured toprocess packets of a plurality of different packet types. For example,the processor 204 can be configured to determine the type of packet andto process the packet and/or fields of the packet accordingly. When thewireless device 202 is implemented or used as an AP 104, the processor204 can also be configured to select and generate one of a plurality ofpacket types. For example, the processor 204 can be configured togenerate a discovery packet including a discovery message and todetermine what type of packet information to use in a particularinstance.

The receiver 212 can be configured to wirelessly receive packets havingdifferent packet types. In some aspects, the receiver 212 can beconfigured to detect a type of a packet used and to process the packetaccordingly.

The wireless device 202 can also include a signal detector 218 that canbe used in an effort to detect and quantify the level of signalsreceived by the transceiver 214. The signal detector 218 can detect suchsignals as total energy, energy per subcarrier per symbol, powerspectral density and other signals. The wireless device 202 can alsoinclude a digital signal processor (DSP) 220 for use in processingsignals. The DSP 220 can be configured to generate a packet fortransmission. In some aspects, the packet can include a physical layerdata unit (PPDU).

The wireless device 202 can further include a user interface 222 in someaspects. The user interface 222 can include a keypad, a microphone, aspeaker, and/or a display. The user interface 222 can include anyelement or component that conveys information to a user of the wirelessdevice 202 and/or receives input from the user.

The various components of the wireless device 202 can be coupledtogether by a bus system 226. The bus system 226 can include a data bus,for example, as well as a power bus, a control signal bus, and a statussignal bus in addition to the data bus. The components of the wirelessdevice 202 can be coupled together or accept or provide inputs to eachother using some other mechanism.

Although a number of separate components are illustrated in FIG. 2, oneor more of the components can be combined or commonly implemented. Forexample, the processor 204 can be used to implement not only thefunctionality described above with respect to the processor 204, butalso to implement the functionality described above with respect to thesignal detector 218 and/or the DSP 220. Further, each of the componentsillustrated in FIG. 2 can be implemented using a plurality of separateelements.

Devices, such as STAs, 106 a-106 i shown in FIG. 1B, for example, can beused for neighborhood-aware networking, or NANing. For example, variousstations within the network can communicate on a device to device (e.g.,peer-to-peer communications) basis with one another regardingapplications that each of the stations supports. A discovery protocolcan be used in a NAN to enable STAs to advertise themselves (e.g., bysending discovery packets) as well as discover services provided byother STAs (e.g., by sending paging or query packets), while ensuringsecure communication and low power consumption.

In a neighborhood-aware or NAN, one device, such as STA or wirelessdevice 202, in the network can be designated as the root device or node.In some embodiments, the root device can be an ordinary device, like theother devices in the network, rather than a specialized device such as arouter. In NAN, the root node can be responsible for periodicallytransmitting synchronization messages, or synchronization signals orframes, to other nodes in the network. The synchronization messagestransmitted by root node can provide a timing reference for other nodesto coordinate an availability window during which communication occursbetween the nodes. The synchronization message can also provide updatesto a schedule for future availability windows. The synchronizationmessages can also function to notify STAs that they are still present inthe peer-to-peer network.

In a Neighborhood aware Network (NAN), STA's on the network can usesynchronization messages transmitted by a root STA and retransmitted bybranch STA's in order to determine availability windows. During theseavailability windows, STA's in the NAN can be configured to transmitand/or receive messages from other STA's on the network. At other times,STA's, or portions of STA's, on the NAN can be in a sleep state. Forexample, an STA on a NAN, such as wireless device 202, can enter a sleepstate based at least in part on synchronization messages received from aroot node. In some embodiments, STA's on a NAN can enter a sleep mode,where one or more elements of the STA can enter a sleep mode, ratherthan the entire STA. For example, STA 202 can enter a sleep mode wherethe transmitter 210, receiver 212, and/or transceiver 214 can enter asleep mode based on synchronization messages received on a NAN. Thissleep mode can enable the STA 202 to conserve power or battery life.

FIG. 3 illustrates an example of a NAN 320 in which aspects of thepresent disclosure can be employed. A master STA 300 of the networkprovides synchronization information to the nodes. In this way, themaster STA 300 is configured to transmit and receive messages 310, 311,312, and 314 with the STA's on the NAN 320.

STA's 300, 302, and 304 can be nodes on the NAN 320. As nodes on the NAN320, STA's 300, 302, and 304 can transmit messages 312, and 314 to otherSTA's on the network 320. These messages can be transmitted to otherSTA's during an availability window, during which time each STA isconfigured to transmit and/or receive transmissions from other STA's onthe network 320. For example, STA 302 can transmit messages 312 to STA304 during an availability window for both STA's, where the availabilitywindows is based in part upon a synchronization message received from aroot STA.

Because STA's on the NAN 320 are wireless and can have a finite amountof power between charges, it is advantageous if the STA's do notrepeatedly wake from a sleep state to periodically transmit and/orreceive synchronization messages between the STA's of the NAN 320. Thus,it would be advantageous if the STA's 300, 302, and 304 were able tostay longer in a sleep state to conserve power and not wake from thesleep state to transmit and/or receive synchronization messages on thenetwork.

Master STA 300 can periodically transmit synchronization messages withinthe NAN 320. In some embodiments, synchronization messages can indicatethe frequency of availability windows for STA's in the network 320, andcan further indicate the frequency of synchronization messages and/orthe interval until the next synchronization message. In this way, masterSTA 300 provides synchronization and some discovery functionality to thenetwork 320. Since the master STA may not go to sleep, or can sleep lessoften than other nodes, the master STA is able to coordinate discoveryand timing for the NAN 320 independent of the state of the STA's 302,and 304. In this way, the STA's 302, and 304 rely on the master STA 300for this functionality and can stay longer in the sleep state to savepower.

FIG. 4 illustrates an exemplary discovery window structure for an STA todiscover the NAN 320 in accordance with an exemplary implementation ofthe invention. The exemplary discovery window structure 400 can includea discovery window (DW) 402 of time duration 404 and an overalldiscovery period (DP) 406 interval of time duration 408. In someaspects, communications can occur via other channels as well. Timeincreases horizontally across the page over the time axis.

During the DW 402, STAs can advertise services through broadcastmessages such as discovery packets or discovery frames. STAs can listento broadcast messages transmitted by other STAs. In some aspects, theduration of DWs can vary over time. In other aspects, the duration ofthe DW can remain fixed over a period of time. The end of the DW 402 canbe separated from the beginning of the subsequent DW by a firstremainder period of time as illustrated in FIG. 4.

The overall interval of duration 408 can measure the period of time fromthe beginning of one DW to the beginning of a subsequent DW asillustrated in FIG. 4. In some embodiments, the duration 408 can bereferred to as a discovery period (DP). In some aspects, the duration ofthe overall interval can vary over time. In other aspects, the durationof the overall interval can remain constant over a period of time. Atthe conclusion of the overall interval of duration 408, another overallinterval can begin, including a DW and the remainder interval.Consecutive overall intervals can follow indefinitely or continue for afixed period of time. A STA can enter a sleep or power-save mode whenthe STA is not transmitting or listening or is not expecting to transmitor listen.

Discovery queries are transmitted during the DW 402. STA responses tothe transmitted discovery queries are transmitted during the DP 406. Asexplained below, the allocated time for transmitting responses to thetransmitted probe or discovery queries can, for example, overlap withthe allocated time for transmitting the discovery queries, be adjacentto the allocated time for transmitting the discovery queries, or be atsome time period after the end of the allocated time for transmittingthe discovery queries.

The STA which sent the request for a NAN 320 subsequently wakes up toreceive a beacon. The STA in the sleep mode or power-save mode can awakeor return to normal operation or full power mode at the beginning of thebeacon 410 to enable listening by the STA. In some aspects, the STA canawake or return to normal operation or full power mode at other timeswhen the STA expects to communicate with another device, or as a resultof receiving a notification packet instructing the STA to awake. The STAcan awake early to ensure that the STA receives the beacon 410. Thebeacon includes an information element, described below, which at leastidentifies the NAN 320 which is responsive to the probe request of theSTA.

The start and end of the DW 402 can be known via numerous methods toeach STA desiring to transmit a probe or discovery query. In someaspects, each STA can wait for a beacon. The beacon can specify thestart and end of the DW 402.

FIG. 5A shows an exemplary structure of a media access control (MAC)frame 500. In some aspects, the media access control frame (MAC) 500 canbe utilized for the beacon signal 410 discussed above. As shown, the MACframe 500 includes 11 different fields frame control (FC) field 502 aduration/identification (dur) field 504, a receiver address (A1) field506, a transmitter address (A2) field 508, a destination address (A3)field 510, which in some aspects can indicate a NAN BSSID, a sequencecontrol (sc) field 512, a timestamp field 514, a beacon interval field516, a capability field 518, an information element 520 including windowinformation, and a frame check sequence (FCS) field 522. The fields502-522 include a MAC header in some aspects. Each field can include oneor more sub-fields or fields. For example, frame control field 502 ofmedia access control header 500 can include multiple subfields, such asa protocol version, type field, subtype field, and other fields.Moreover, a person having ordinary skill in the art will appreciate thatthe various fields described herein can be rearranged, resized, somefields can be omitted, and additional fields can be added.

In some aspects, the NAN BSSID field 510 can indicate a cluster of NANdevices. In another embodiment, each NAN can have a different (forexample, pseudorandom) NAN BSSID 510. In an embodiment, the NAN BSSID510 can be based on a service application. For example, a NAN created byApplication A can have a BSSID 510 based on an identifier of ApplicationA. In some embodiments, the NAN BSSID 510 can be defined by astandards-body. In some embodiments, the NAN BSSID 510 can be based onother contextual information and/or device characteristics such as, forexample, a device location, a server-assigned ID, etc. In one example,the NAN BSSID 510 can include a hash of the latitude and longitudelocation of the NAN. The NAN BSSID field 510 shown is six octets long.In some implementations, NAN BSSID field 510 can be four, five, or eightoctets long. In some embodiments, the AP 104 can indicate the NAN BSSID510 in an information element.

In various embodiments, the frame 500, or another discovery frame, caninclude the MPV. In an embodiment, the FC field 502 can include the MPV.In an embodiment, the A2 field 508 can include the MPV. In variousexamples, the entire A2 field 508 can include the MPV, one or moremost-significant-bits (MSBs) or least-significant-bits (LSBs) can bereplaced with the MPV, etc. In an embodiment, the NAN-BSSID field 510can include the MPV. In various examples, the entire NAN-BSSID field 510can include the MPV, one or more most-significant-bits (MSBs) orleast-significant-bits (LSBs) can be replaced with the MPV, etc. In anembodiment, the capability field 518 can include the MPV. In anembodiment, one or more information elements (IEs) 520 can include theMPV, for example as an attribute. In one example, the IE 600, describedbelow with respect to FIG. 6A, can include the MPV, although other IEscan include the MPV. In various embodiments described herein, fieldsthat include the MPV can alternatively include an indication orrepresentation of the MPV rather than the MPV itself

FIG. 5B shows an exemplary structure of a master preference value (MPV)550. In some aspects, the MPV 550 can be utilized for election of amaster node and/or processing of NAN messages, for example as describedin herein with respect to FIGS. 11-13. As shown, the MPV 550 includes ananchor flag 552, a hop indicator 554, a preference indicator 556 and areserved bit 558. A person having ordinary skill in the art willappreciate that the various fields described herein can be rearranged,resized, some fields can be omitted, and additional fields can be added.

The anchor flag 552 serves to indicate whether the STA 106 transmittingthe MPV is an anchor node. As shown, the anchor flag 552 is one bitlong. In various other embodiments, the anchor flag 552 can be anotherlength such as, for example, two or three bits long. In someembodiments, the anchor flag 552 can be variable length.

In an embodiment, the STA 106 can set the anchor flag 552 to 0b1 whenthe STA 106 is an anchor node. The STA 106 can set the anchor flag 552to 0b0 when the STA 106 is not an anchor node. Thus, the STA 106 can setthe anchor flag 563 to 0b0 in embodiments where the STA 106 is in anon-anchored NAN. Accordingly, anchor nodes can have a higher MPV 550than non-anchor nodes. Thus, in some embodiments, anchor nodes can begiven preference in master node election and/or NAN message processing.

The hop indicator 554 serves to indicate a hop distance of thetransmitting STA 106 to the nearest anchor node. For example, inanchored NANs, a node that receives one or more messages from an anchornode (i.e., a node that can “hear” an anchor node) can set the hopindicator 554 to 0b111. In an embodiment, a node that does not receiveany messages from an anchor node (i.e., a node that cannot “hear” ananchor node) can set the hop indicator 554 to the highest hop indicator554 received from any node, minus one. For example, a node that hasreceived a highest hop indicator 554 of 0b111 from another node can setits hop indicator 554 to 0b110, a node that has received a highest hopindicator 554 of 0b110 from another node can set its hop indicator 554to 0x101, and so on.

In various other embodiments the hop indicator 554 can be incrementedrather than decremented as hop distance increases. In some embodiments,anchor nodes can set the hop indicator 554 to all ones or 0x111. In someembodiments, a node that receives one or more messages from an anchornode (i.e., a node that can “hear” an anchor node) can set the hopindicator 554 to the hop indicator 554 of the anchor node, minus one.For example, where an anchor node sets a hop indicator 554 to 0x111, anon-anchor node that can hear the anchor node can set its hop indicator554 to 0x110. In some embodiments, STAs 106 in a non-anchored NAN canset the hop indicator 554 to zero or 0b000. As shown, the hop indicator554 is three bits long. In various other embodiments, the hop indicator554 can be another length such as, for example, two or four bits long.In some embodiments, the hop indicator 554 can be variable length.

The preference indicator 556 serves to indicate a preference of the STA106 for becoming a master node. As shown, the preference indicator 556is three bits long. In various other embodiments, the preferenceindicator 556 can be another length such as, for example, two or fourbits long. In some embodiments, the preference indicator 556 can bevariable length. The STA 106 can set the preference indicator 556 basedon one or more device characteristics, capabilities, and/or features.

In various embodiments, the STA 106 can increase and/or decrease thepreference indicator 556, subject to a maximum and minimum value, basedon one or more of: an RF characteristic (e.g., link speed, signalstrength, etc.), a power source, a power consumption rate, a remainingbattery power, a clock type, a clock accuracy, a processor load, a userinteraction, a preset value, etc. For example, the STA 106 can incrementthe preference indicator 556 when the STA 106 is plugged into mainspower source or when it has synchronized its clock signal via globalpositioning system (GPS). As another example, the STA 106 can decrementthe preference indicator 556 and/or refrain from incrementing thepreference indicator 556 when the STA 106 has a high processor loadand/or has an RF link with an error rate above a threshold.

FIG. 5C shows an exemplary structure of a master preference value (MPV)560. In some aspects, the MPV 560 can be utilized for election of amaster node and/or processing of NAN messages, for example as describedin herein with respect to FIGS. 11-13. As shown, the MPV 560 includes asynchronization preference value (SPV) 561 and a discovery preferencevalue (DPV) 562. A person having ordinary skill in the art willappreciate that the various fields described herein can be rearranged,resized, some fields can be omitted, and additional fields can be added.

The synchronization preference value 561 indicates a preference orsuitability for a transmitting node to become a master node. As shown,the synchronization preference value 561 includes an anchor flag 563, asynchronization time age indicator (STAI) 564, and a hop indicator 565.As shown, the synchronization preference value 561 is seven bits long.In various other embodiments, the synchronization preference value 561can be another length such as, for example, four or eleven bits long. Insome embodiments, the synchronization preference value 561 can bevariable length. A person having ordinary skill in the art willappreciate that the various fields described herein can be rearranged,resized, some fields can be omitted, and additional fields can be added.

The anchor flag 563 serves to indicate whether the STA 106 transmittingthe MPV is an anchor node. As shown, the anchor flag 563 is one bitlong. In various other embodiments, the anchor flag 563 can be anotherlength such as, for example, two or three bits long. In someembodiments, the anchor flag 563 can be variable length.

In an embodiment, the STA 106 can set the anchor flag 563 to 0b1 whenthe STA 106 is an anchor node. The STA 106 can set the anchor flag 563to 0b0 when the STA 106 is not an anchor node. Thus, the STA 106 can setthe anchor flag 563 to 0b0 in embodiments where the STA 106 is in anon-anchored NAN. Accordingly, anchor nodes can have a higher MPV 560than non-anchor nodes. Thus, in some embodiments, anchor nodes can begiven preference in master node election and/or NAN message processing.

The synchronization time age indicator 564 serves to indicate a measureof how much time has passed since the transmitting node last synched itsclock to an anchor node clock. As shown, the synchronization time ageindicator 564 is three bits long. In various other embodiments, thesynchronization time age indicator 564 can be another length such as,for example, two or four bits long. In some embodiments, synchronizationtime age indicator 564 can be variable length.

In an embodiment, the STA 106 can set the synchronization time ageindicator 564 to 0b111 when the STA 106 is an anchor node. When the STA106 is not an anchor node, the STA 106 can receive a beacon (including asynchronization time age indicator) from another node (referred toherein as the “synchronization node”), and can synchronize its clockbased on the beacon. The STA 106 can set the synchronization time ageindicator 564 to the synchronization time age indicator in the beaconreceived from the synchronization node, minus a number of discoverywindows that have elapsed since the beacon was received.

For example, a STA 106 that receives a beacon from an anchor node in acurrent discovery window can set its synchronization time age indicator564 to 0b111−0b0=0b111. In the next discovery window, the STA 106 canset its synchronization time age indicator 564 to 0b111−0b1=0b110, andso on. Accordingly, non-anchor STAs 106 that have recently synchronizedtheir clocks with an anchor node can have a relatively higher MPV 560.Thus, in some embodiments, STAs 106 with relatively up-to-date clockscan be given preference in master node election and/or NAN messageprocessing. In embodiments where the STA 106 is in a non-anchored NAN,the STA 106 can set the synchronization time age indicator 564 to zeroor 0b000.

The hop indicator 565 serves to indicate a hop distance of thetransmitting STA 106 to the nearest anchor node. For example, inanchored NANs, a node that receives one or more messages from an anchornode (i.e., a node that can “hear” an anchor node) can set the hopindicator 565 to 0b111. In an embodiment, a node that does not receiveany messages from an anchor node (i.e., a node that cannot “hear” ananchor node) can set the hop indicator 565 to the highest hop indicator565 received from any node, minus one. For example, a node that hasreceived a highest hop indicator 565 of 0b111 from another node can setits hop indicator 565 to 0b110, a node that has received a highest hopindicator 565 of 0b110 from another node can set its hop indicator 565to 0x101, and so on.

In various other embodiments the hop indicator 565 can be incrementedrather than decremented as hop distance increases. In some embodiments,anchor nodes can set the hop indicator 565 to all ones or 0x111. In someembodiments, a node that receives one or more messages from an anchornode (i.e., a node that can “hear” an anchor node) can set the hopindicator 565 to the hop indicator 565 of the anchor node, minus one.For example, where an anchor node sets a hop indicator 565 to 0x111, anon-anchor node that can hear the anchor node can set its hop indicator565 to 0x110. In some embodiments, STAs 106 in a non-anchored NAN canset the hop indicator 565 to zero or 0b000. As shown, the hop indicator565 is three bits long. In various other embodiments, the hop indicator565 can be another length such as, for example, two or four bits long.In some embodiments, the hop indicator 565 can be variable length.

The discovery preference value 562 indicates a preference or suitabilityfor a transmitting node to become a master node. As shown, the discoverypreference value 562 includes a preference indicator 566 and fivereserved bits 567. As shown, the discovery preference value 562 is ninebits long. In various other embodiments, the discovery preference value562 can be another length such as, for example, three or four bits long.In some embodiments, the discovery preference value 562 can be variablelength. A person having ordinary skill in the art will appreciate thatthe various fields described herein can be rearranged, resized, somefields can be omitted, and additional fields can be added.

The preference indicator 566 serves to indicate a preference of the STA106 for becoming a master node. As shown, the preference indicator 566is four bits long. In various other embodiments, the preferenceindicator 566 can be another length such as, for example, three or fivebits long. In some embodiments, the preference indicator 566 can bevariable length. The STA 106 can set the preference indicator 566 basedon one or more device characteristics, capabilities, and/or features.

In various embodiments, the STA 106 can increase and/or decrease thepreference indicator 566, subject to a maximum and minimum value, basedon one or more of: an RF characteristic (e.g., link speed, signalstrength, etc.), a power source, a power consumption rate, a remainingbattery power, a clock type, a clock accuracy, a processor load, a userinteraction, a preset value, etc. For example, the STA 106 can incrementthe preference indicator 566 when the STA 106 is plugged into mainspower source or when it has synchronized its clock signal via globalpositioning system (GPS), or using a Wide Area Network timing source. Asanother example, the STA 106 can decrement the preference indicator 566and/or refrain from incrementing the preference indicator 566 when theSTA 106 has a high processor load and/or has an RF link with an errorrate above a threshold.

FIG. 6A shows an exemplary attribute of a NAN information element (IE)600 that can be employed within the NAN 320 of FIG. 3. In variousembodiments, any device described herein, or another compatible device,can transmit the attribute of the NAN IE 600 such as, for example, theAP 104 (FIG. 3). One or more messages in the wireless NAN 320 caninclude the attribute of the NAN IE 600 such as, for example, the beacon410. In some aspects, the NAN information element 600 can be included inMAC header 500 field 520 as described above.

As shown in FIG. 6A, the attribute of the NAN IE 600 includes anattribute ID 602, a length field 604, a Timestamp of a next DiscoveryQuery Window (DQW) field 606, a Timestamp of the next Discovery ResponseWindow (DRW) field 608, a Discovery Query Window (DQW) duration field610, a Discovery Response Window (DRW) duration field 612, a DQW Periodfield 614, a DRW Period field 616, a Beacon Window field 618, and atransmit address field 620. A person having ordinary skill in the artwill appreciate that the attribute of the NAN IE 600 can includeadditional fields, and fields can be rearranged, removed, and/orresized.

The attribute identifier field 602 shown is one octet long. In someimplementations, the attribute identifier field 602 can be two, five, ortwelve octets long. In some implementations, the attribute identifierfield 602 can be of variable length, such as varying length from signalto signal and/or as between service providers. The attribute identifierfield 602 can include a value which identifies the element as anattribute of the NAN IE 600.

The length field 604 can be used to indicate the length of the attributeof the NAN IE 600 or the total length of subsequent fields. The lengthfield 604 shown in FIG. 6A is two octets long. In some implementations,the length field 604 can be one, five, or twelve octets long. In someimplementations, the length field 604 can be of variable length, such asvarying length from signal to signal and/or as between serviceproviders.

The Timestamp of next DQW field 606 can indicate a start time of thenext discovery query window (for example, the start of the nextdiscovery period 406 described above with respect to FIG. 4). In variousembodiments, the start time can be indicated using an absolute timestampor a relative timestamp. The Timestamp of next DQR field 608 canindicate a start time of the next discovery query response (for example,the start of the next discovery query response period described belowwith respect to FIGS. 7-9). In various embodiments, the start time canbe indicated using an absolute timestamp or a relative timestamp.

The DQW duration field 610 can indicate a duration of the DQW (forexample, the duration of the DQW described below with respect to FIG.7-9). In various embodiments, the DQW duration field 610 can indicatethe duration of the DQW in ms, μs, time units (TUs), or another unit. Insome embodiments, time units can be 1024 μs. The DQW duration field 610shown is two octets long. In some implementations, DQW duration field610 can be four, six, or eight octets long.

The DRW duration field 612 can indicate a duration of the DRW (forexample, the duration of the DRW described below with respect to FIG.7-9). In various embodiments, the DRW duration field 612 can indicatethe duration of the DRW in ms, μs, time units (TUs), or another unit. Insome embodiments, time units can be 1024 μs. The DRW duration field 612shown is two octets long. In some implementations, DRW duration field612 can be four, six, or eight octets long.

In some embodiments, the DQW period field 614 can indicate a length ofthe DQW (described below with respect to FIGS. 7-9). In variousembodiments, the DQW period field 614 can indicate the length of the DQWin ms, μs, time units (TUs), or another unit. In some embodiments, timeunits can be 1024 μs. The DQW period field 614 shown is between two andeight octets long. In some implementations, the DQW period field 614 canbe two, four, six, or eight octets long.

In some embodiments, the DRW period field 616 can indicate a length ofthe DRW (described below with respect to FIGS. 7-9). In variousembodiments, the DRW period field 616 can indicate the length of the DRWin ms, μs, time units (TUs), or another unit. In some embodiments, timeunits can be 1024 μs. The DRW period field 616 shown is between two andeight octets long. In some implementations, the DRW period field 616 canbe two, four, six, or eight octets long.

The Beacon Duration field 618 can indicate a duration of a Beacon Window(for example, the duration of the Beacon Window described below withrespect to FIGS. 7-9). In various embodiments, the Beacon Duration field618 can indicate the duration of the Beacon Window in ms, μs, time units(TUs), or another unit. In some embodiments, time units can be 1024 μs.The Beacon Window field 618 shown is between two and eight octets long.In some implementations, Beacon Window field 618 can be four, six, oreight octets long.

The Transmit Address field 620 indicates a network address of a nodetransmitting the NAN IE 600. In some aspects, the A3 field 510 of theMAC header 500 discussed above with respect to FIG. 5A will instead beset to a NAN BSSID. Therefore, NAN IE 600 provides the transmitteraddress field 620 to enable receivers to determine the network addressof the transmitter.

FIG. 6B shows another exemplary attribute of a NAN information element(IE) 650 that can be employed within the NAN 320 of FIG. 3. In variousembodiments, any device described herein, or another compatible device,can transmit the attribute of the NAN IE 650 such as, for example, theAP 104 (FIG. 3). One or more messages in the wireless NAN 320 caninclude the attribute of the NAN IE 650 such as, for example, the beacon410. In some aspects, the NAN information element 650 can be included inMAC header 500 field 520 as described above.

NAN information element 650 differs from NAN information element 600 inthat the discovery query window timestamp and the discovery queryresponse window timestamp have been removed from NAN information element650 relative to NAN information element 600. In some aspects, a receiverof NAN information element 650 can determine a discovery query windowstart time as the time when a local clock reference that is synchronizedto a NAN clock reference is evenly divided by the DQW period field 660(Station Clock mod DQW period=0). Similarly, the discovery responsewindow start time can be determined in some aspects based on when alocal clock synchronized to a NAN clock reference is evenly divided bythe DRW period field 662 (Station Clock mod DRW period=0). Note thatthese example methods of determining a discovery query window ordiscovery response window start time are similar to the method used todetermine a beacon window start time, which can be found in some aspectsas Station Clock mod Beacon Interval=0).

FIG. 7 is a timing diagram illustrating one embodiment of a beaconwindow, discovery query window, and discovery query response window. Aportion 701 of the timeline 702 is expanded as the lower timeline 703.Timeline 702 shows a series of beacon signals 705. Shown on the expandedtimeline 703 are a discovery window 710 and a discovery query responsewindow 715. Expanded timeline 703 also shows that one or more beaconwindows 720 a-b can occur within the discovery period. In an embodiment,sync frames can be transmitted during the beacon window. In someembodiments, sync frames can be transmitted at a specific target beacontransmission time (TBTT) within the beacon window. In the illustratedembodiment, the discovery query window 710 is completely within thediscovery query response window 715.

FIG. 8 is a timing diagram illustrating one embodiment of a beaconwindow, discovery query window, and discovery query response window. Aportion 801 of the timeline 802 is expanded as the lower timeline 803.Timeline 802 shows a series of beacon signals 805. Shown on the expandedtimeline 803 are a discovery window 810 and a discovery query responsewindow 815. Expanded timeline 803 also shows that one or more beaconwindows 820 a-b can occur within the discovery period. In theillustrated embodiment of FIG. 8, the discovery query window 810 doesnot overlap the discovery query response window 815. Instead, thediscovery query response window 815 immediately follows the end of thediscovery query window 810.

FIG. 9 is a timing diagram illustrating one embodiment of a beaconwindow, discovery query window, and discovery query response window. Aportion of timeline 902 is expanded as the lower timeline 903. Timeline902 shows a series of beacon signals 905. Shown on the expanded timeline903 are a discovery window 910 and a discovery query response window915. Expanded timeline 903 also shows that one or more beacon windows920 can occur within the discovery period. In the illustrated embodimentof FIG. 9, the timing of the discovery query window 910 is unrelated tothe timing of the discovery query response window 915.

Certain aspects described herein are directed to devices and methods forsynchronization of clock signals of STAs operating in a peer-to-peerfashion. In aspect, at least some of the STAs may transmit the currenttime value of their clock signals to the other STAs. For example, inaccordance with certain embodiments, STAs may periodically transmit a“sync” frame that carries a timestamp. The current time value maycorrespond to a time-stamp value. For example, in one embodiment, adiscovery message as described above may serve as the ‘sync’ frame andcarry a current time value of a STA 106. In addition to the timestamp,the sync frame may also include information regarding the discoveryinterval and discovery period. For example, the sync frame may includethe schedule of the discovery interval and discovery period. Uponreceipt of a sync frame, a STA 106 that may be new to the network maydetermine the time and the discovery interval/discovery period schedulein the network. STAs already communicating within the network maymaintain synchronization while overcoming clock drift as describedbelow. Based on the sync message, STAs may enter and exit a network(e.g., a NAN) without losing synchronization. Furthermore, thesynchronization messages described herein may allow for avoidingexcessive power drain and the STAs in the network may share the burdenof messaging for synchronization. Furthermore, certain embodiments allowfor a low messaging overhead (e.g., as only a few devices may send syncframes in every discovery period as will be described below). Asdescribed above with reference to FIG. 4, for example, discovery packetswithin a NAN are transmitted during a discovery interval 402 that occursevery discovery period 406. As such, sync messages may be sent during adiscovery interval 402 for certain discovery periods.

FIG. 10 illustrates a message 1000 that can include a time value forsynchronization. As described above, in some embodiments, the message1000 can correspond to a discovery message. The message 1000 can includea discovery packet header 1008. The message can further include 1010 atime value for synchronization 1010. In some embodiments, the discoverypacket header 1008 can include the time value 1010. The time value cancorrespond to a current time value of a clock signal of a STA 106transmitting the message 1000. In addition the message 1000 can includetime value information 1011 that can relate to the accuracy of the timevalue or how it might be used in synchronization. In an embodiment, thetime value information 1011 can include the MPV of the STA 106. Themessage 1000 can further include discovery packet data 1012. While FIG.10 shows a discovery message serving as the sync message, it should beappreciated that according to other embodiments, the sync message can besent apart from the discovery message. Moreover, a person havingordinary skill in the art will appreciate that the various fieldsdescribed herein can be rearranged, resized, some fields can be omitted,and additional fields can be added.

It should be appreciated that a STA 106 may not transmit a sync frameevery discovery interval. Rather, a probability value (P_sync), as isfurther described below, may be used to determine whether the STA 106transmits and/or prepares a sync frame. As such, while in someembodiments, at least some sync frames are sent for every discoveryinterval, in certain embodiments, not all the STAs participating in theNAN transmit a sync frame for every discovery interval. Probabilisticframe preparation and/or transmission can allow for reduced powerconsumption in transmitting sync frames while still enablingsynchronization.

FIG. 11 shows a flowchart 1100 of a method of transmitting and receivinga synchronization frame in accordance with an embodiment. The method canbe implemented in whole or in part by the devices described herein, suchas the wireless device 202 shown in FIG. 2 of any of the STAs 106 a-106i shown in FIGS. 1A-1B. Although the illustrated method is describedherein with reference to the wireless communication systems 100 and 160discussed above with respect to FIGS. 1A-1B, and the wireless device 202discussed above with respect to FIG. 2, a person having ordinary skillin the art will appreciate that the illustrated method can beimplemented by another device described herein, or any other suitabledevice. Although the illustrated method is described herein withreference to a particular order, in various embodiments, blocks hereincan be performed in a different order, or omitted, and additional blockscan be added. Moreover, although the method of flowchart 1100 isdescribed herein with respect to synchronization frames, the method canbe applied to master election and processing for any type of NAN frameincluding, for example, synchronization beacons and cluster discoverybeacons.

In one aspect, at block 1101, the device 202 determines whether a syncframe is to be prepared for transmission for the discovery intervalusing a probability value P_sync. Stated another way, the device 202 maydetermine whether to prepare a sync frame for transmission based on aprobability value. Alternatively, the device 202 can determine whetherto cancel or transmit a prepared sync frame using the probability valueP_sync. Accordingly, sync frames are only sent by a certain number ofnodes within a NAN for any one discovery period.

For example, in some cases the probability value may be on the order of1 such that the device 202 prepares the sync frame for transmission forevery discovery period. Alternatively, according to another embodiment,the probability may be on the order of, for example, 0.3 such that thedevice 202 only prepares a sync frame for transmission during adiscovery interval approximately every third discovery period. In anembodiment, each STA 106 can choose a pseudo-random number forcomparison with P_sync, such that different STAs prepare sync frames fortransmission during different discovery periods. In this way, syncframes are likely to be transmitted in all discovery periods but not byall STAs.

In an embodiment, the value of P_sync may be adapted during operation.For example, the value of P_sync may be adapted according to the numberof STAs in the network, and/or the number of STAs detected by the device202. For example, the value of P_sync can be reduced as the number ofSTAs in the neighborhood of the transmitting device 202 increases. Inone embodiment, the device 202 can choose P_sync based on a number ofdevices N according to Equations 1-3, below.

$\begin{matrix}{{{erfc}\left\{ \frac{{M\; 1} - {{N \cdot p}\; 1}}{\sqrt{2{N\left( {p\; 1} \right)}\left( {1 - {p\; 1}} \right)}} \right\}} > {T\; 1}} & (1) \\{{{erfc}\left\{ \frac{{M2} - {{N \cdot p}\; 2}}{\sqrt{2{N({p2})}\left( {1 - {p\; 2}} \right)}} \right\}} < {T2}} & (2) \\{{P\_ sync} = {\max \left( {{p\; 1},{p\; 2}} \right)}} & (3)\end{matrix}$

As shown in Equations 1-3, above, the device 202 can choose P_sync suchthat the number of devices that contend is greater than a target minimumnumber of contending devices M1 with a threshold probability T1. Invarious embodiments, M1 can be between around 1 and around 10, such as,for example, 1. In some embodiments, M1 can be determined as apercentage of N such as, for example, 1%, 5%, or 10%. In variousembodiments, T1 can be between around 0.9 and around 0.999, such as, forexample, 0.9. Thus, the device 202 can determine the lowest p1 thatsatisfies Equation 1, where erfc is the complementary error function.

Similarly, the device 202 can choose P_sync such that the number ofdevices that contend is less than a target maximum number of contendingdevices M2 with a threshold probability T2. In various embodiments, M2can be between around 50 and around 100, such as, for example, 75. Insome embodiments, M2 can be determined as a percentage of N such as, forexample, 10%, 15%, or 20%. In various embodiments, T1 can be betweenaround 0.01 and around 0.2, such as, for example, 0.1. Thus, the device202 can determine the highest p2 that satisfies Equation 2, where erfcis the complementary error function.

As shown in Equation 3, the device 202 can choose P_sync as the maximumof p1 and p2. In some embodiments, the device 202 can choose P_sync asthe minimum of p1 and p2. In various other embodiments, the device 202can choose P_sync as another value between p1 and p2 such as, forexample, the average of p1 and p2, or more generally the sum of p1 andp2 times a fraction.

If the device 202 determines at block 1101 to prepare a sync frame basedon the probability P_sync, then at block 1102, a sync frame is preparedfor transmission. If the device 202 determines at block 1101 not toprepare the sync frame, then the device 202 can listen for time valuesfrom other STAs and update its own time value based on received timevalues as necessary to be synchronized (for example, at block 1112).

As discussed above, at block 1102, the device 202 prepares a sync framefor transmission. The sync frame can include a timestamp of the device202 as described above, for example with respect to FIG. 10. Inaddition, the sync frame can include a network identifier thatidentifiers the NAN or “social Wi-Fi” network in which the device 202 isparticipating within. The identifier can be randomly generated when thenetwork is first established between the STAs and can remain during thelifetime of the network. A device 202 receiving a sync frame with anetwork identifier may only perform an update of a time value based on areceived time value if the network identifier received matches thenetwork identifier of the network that the device 202 is currentlyparticipating within.

In some embodiments, the sync frame can include a device identifier suchas, for example, a MAC address of the device 202. In some embodiments,the sync frame can include the MPV of the device 202. For example, thedevice 202 can generate the MPV as described above with respect to theMPV 550 and/or 560 of FIGS. 5B-C. Particularly, the device 202 canassert one or more most significant bit of the MPV when the device 202is an anchor node. When the device 202 is not an anchor node, the devicecan unassert the most significant bit of the MPV. In anchored NANs, thedevice 202 can set one or more hop indication bits based on a hopdistance to the nearest anchor node. In non-anchored NANs, the device202 can unassert all hop indication bits. In both anchored andnon-anchored NANs, the device 202 can set one or more preferenceindication bits based on one or more characteristics of the device 202.

In some embodiments, a plurality of nodes, or every node, in a NAN caneach prepare a sync frame. In some embodiments, a subset of the devicesin the NAN can prepare a sync frame. In some embodiments, the number ofdevices in the subset of devices can be based on the number of devicesin the NAN. For example, the device 202 can prepare the sync frame usinga probability value P_sync, as described above. In some embodiments, thedevice 202 can determine its contention parameters based on its MPV. Forexample, nodes having a higher MPV can attempt to transmit the syncframe during an earlier (or lower) contention slot (or window).

Next, at block 1106, the device 202 can begin a contention procedure fortransmitting the sync frame during the discovery interval. In anembodiment, the device 202 can use contention parameters based on itsMPV. For example, in some embodiments, the device 202 can determinewhether it is an anchor node. If the device 202 is an anchor node, thedevice 202 can use a smaller contention window than a device that is notan anchor node. In some embodiments, the size of the contention windowcan be determined based on the MPV.

In some cases, before the contention procedures allows for the device202 to transmit the sync frame, a sync frame can be received fromanother STA (e.g., STA 106 b) during the discovery interval. Thereceived sync frame can include the MPV 550 and/or 560 discussed abovewith respect to FIGS. 5B-C. For example, in an embodiment, the receivedsync frame can include the MPV 560, the SPV 561, and the DPV 562 of FIG.5C.

At decision block 1108, the device 202 determines whether a sync frameis received from another STA 106 b during the discovery interval. If bydecision block 1108, a sync frame is not received from another STA 106 bduring the discovery interval, at block 1109, the prepared sync frame istransmitted by the device 202.

If a sync frame was received from another STA 106 b, then at block 1110,the device 202 determines whether to transmit or suppress transmissionof the prepared sync frame based on one or more of the received MPV 550or 560, the received SPV 561, and the received DPV 562. For example, thedevice 202 can determine the MPV of the STA 106 b from a capabilityfield transmitted by the STA 106 b. In some embodiments, the device 202can determine whether to transmit or suppress transmission of theprepared sync frame in accordance with Table 1, below.

TABLE 1 Received DPV Received DPV Received DPV Higher than Equal toCurrent Lower than Current DPV DPV Current DPV Received MPV SuppressSuppress Transmit Higher than Current MPV Received MPV Suppress SuppressTransmit Equal to Current MPV Received MPV Transmit Transmit TransmitLower than Current MPV

Thus, if the received MPV is greater than or equal to the current MPV ofthe device 202, and the received DPV is greater than or equal to thecurrent DPV of the device 202, then the device 202 cancels transmissionof the sync frame at block 1111. If the received MPV is less than thecurrent MPV of the device 202, or the received DPV is less than thecurrent DPV of the device 202, then the device 202 proceeds to transmitthe prepared sync frame at block 1109, at the next available timeaccording to contention parameters.

A person having ordinary skill in the art will appreciate thatalternative MPV schemes can be used. In an exemplary alternative scheme,the device 202 can determine whether the MPV of the device transmittingthe sync frame is greater than or equal to the MPV of the device 202. Ifthe received MPV is greater than or equal to the current MPV of thedevice 202, then the device 202 can cancel transmission of the syncframe at block 1111. If the received MPV is less than the current MPV ofthe device 202, then the device 202 can proceed to transmit the preparedsync frame at block 1109, at the next available time according tocontention parameters. In one embodiment, lower MPVs can have greaterpreference for sync frame transmission.

At block 1111, if it is determined at block 1108 to cancel sync frametransmission, then the device 202 can listen for time values from otherSTAs and update its own time value based on received time values asnecessary to be synchronized. For example, the received timestamp fromSTA 106 b can then be used to potentially update the time of the device202 according to one or more criteria as described in the embodimentsbelow.

For example, at block 1112, the device 202 determines if the receivedtimestamp is greater than a current time of the device 202. If, thereceived timestamp is greater than the current timestamp of the device202, the device 202 adopts the received timestamp for use in determiningwhen to transmit and receive as shown in block 1114. Otherwise, thecurrent timestamp of the device 202 is not adopted at block 1116. Inanother embodiment, the device 202 can update its time value to themaximum of all received timestamps, all received timestamps sent by aSTA having a higher MPV, or otherwise provided by any device or acombination of the embodiments described herein. The timestamp of thedevice 202 may not count in determining the maximum. This can ensurethat a device 202 that has a faster drift and has not transmitted itssync frame keeps its clock in sync.

In a particular example, the device 202 can receive one or more beaconsduring the DW 402 (FIG. 4). Each beacon can include at least atimestamp, an MPV, and a device identifier such as a MAC address. Thedevice 202 can store the received timestamp, MPV, and device identifierfor each received beacon. At or around the end of the DW 402 (FIG. 4),the device 202 can update a timing synchronization function (TSF) timerto the received timestamp associated with the highest MPV. In caseswhere a plurality of timestamps have the same MPV, the device 202 canupdate the TSF timer further based on the device identifier. Forexample, the device 202 can use the timestamp associated with thehighest MAC address, the highest hashed MAC address, etc. In someembodiments, cases where a plurality of timestamps have the same MPV,the device 202 can update the TSF timer further based on the timestamp.For example, the device 202 can use the timestamp having the greatestvalue.

In an embodiment, the device 202 can update the TSF timer based on thereceived timestamps in the beacons transmitted, including any beaconstransmitted by the device 202. In this embodiment, the master rank orMPV of the device 202 and the MPV of the beacons received aredisregarded for the update of the TSF. The device 202 can only updateits TSF time using beacons with the same cluster identifier as its own.Upon receiving a beacon, the device 202 may filter such beacon based ontiming criteria. In an embodiment, the criteria for discarding beaconswill be based on whether a difference between a timestamp in the beaconand a timestamp of the device is greater than a threshold. In anotherembodiment, the criteria for discarding beacons will be based on whethera difference between a timestamp in the beacon and a mean of thetimestamps of the other beacons is greater than a threshold. For allbeacons that are not discarded, the device 202 will update the TSF basedon the timestamps of the received beacons. In an embodiment, the device202 can update the TSF to the mean of the timestamps from the receivedbeacons. In another embodiment, the device 202 can update the TSF to themaximum of the timestamps from the received beacons. In anotherembodiment, the device 202 can update the TSF to the minimum of thetimestamps from the received beacons. In another embodiment, the device202 can update the TSF to the median of the timestamps from the receivedbeacons.

In an embodiment, the device 202 can update the TSF timer when itreceives a beacon, either directly from an anchor node or indirectlyfrom other devices that are one or more hops away from the anchor node,that indicates the latest time value of the anchor node. Upon receivinga beacon, the device 202 may filter such beacon based on timingcriteria. In one embodiment, the criteria for discarding beacons will bebased on whether a difference between a time value when the beacon lastreceived anchor timing information from an anchor (i.e. the value of thesynchronization time age indicator 564) and the current time value forthe device 202 is greater than a threshold. The anchor timinginformation may include a time value of when the device or beacon lastupdated its timing information with the anchor node. For all beaconsthat are not discarded, the device 202 will update the TSF based on theanchor time information of the received beacons. In some embodiments,when a device 202 receives anchor timing information from more than onedevice, the device 202 may update its TSF time from the device that hasthe most recent anchor timing information, provided that the anchortiming information is more recent than the device 202's anchor timinginformation.

In a non-anchored network, the TSF in different master nodes or devicescan potentially drift. In an embodiment, the device 202 can update theTSF timer based on the received timestamps in the beacons transmitted,including any beacons transmitted by the device 202. For example, if thedevice 202 receives one or more beacons and none of the beacons are froman anchor node, the device 202 will update the TSF to the maximum of thetimestamps from the received beacons.

In an embodiment, the criteria for updating a current time value of adevice 202 based on received time value from another STA 106 b canfurther depend on the received signal strength indication (RSSI) of thedevice 202. For example, based on the RSSI of the device 202, even wherea device 202 receives a sync frame, it can nonetheless proceed withtransmitting a sync frame it has prepared. In another embodiment, thecriteria for updating the current time value of the device 202 can bebased on whether the received time is a threshold amount greater thanthe current device time. In an embodiment, the threshold can be based ona maximum allowed clock drift network parameter.

FIG. 12 shows a flowchart 1200 of a method of transmitting asynchronization frame in accordance with an embodiment. In someembodiments, the method can coordinate transmission of sync framesduring TBTTs and/or beacon windows between discovery windows. The methodcan be implemented in whole or in part by the devices described herein,such as the wireless device 202 shown in FIG. 2 of any of the STAs 106a-106 i shown in FIGS. 1A-1B. Although the illustrated method isdescribed herein with reference to the wireless communication systems100 and 160 discussed above with respect to FIGS. 1A-1B, and thewireless device 202 discussed above with respect to FIG. 2, a personhaving ordinary skill in the art will appreciate that the illustratedmethod can be implemented by another device described herein, or anyother suitable device. Although the illustrated method is describedherein with reference to a particular order, in various embodiments,blocks herein can be performed in a different order, or omitted, andadditional blocks can be added.

First, at block 1202, the device 202 determines whether it successfullytransmitted a sync frame during the last discovery window. For example,the device 202 can determine whether it transmitted the prepared syncframe at block 1109 of FIG. 11. If the device 202 did not transmit async frame during the last discovery window, it can act as a non-masternode. Accordingly, the device 202 can refrain from transmittingadditional sync frames at block 1210.

In an embodiment, at block 1210, the device 202 can refrain fromtransmitting additional sync frames for the duration of the currentdiscovery interval. In other words, the device 202 can refrain fromtransmitting additional sync frames until at least the next discoverywindow, during which the device 202 can re-initiate the contentionprocess described in the flowchart 1100 of FIG. 11. In some embodiments,the device 202 can particularly refrain from transmitting additionalsync frames during TBTTs and/or beacon windows between discoverywindows.

Next, at block 1215, when the device 202 has transmitted a sync frameduring the last discovery window, the device 202 determines whether itshould transmit or suppress additional sync frames based on one or moreof an MPV, an SPV, and a DPV of one or more received sync frames. Forexample, the device 202 can receive and/or decode one or more syncframes from other devices. Received sync frames can include the MPV 550and/or 560 discussed above with respect to FIGS. 5B-C. For example, inan embodiment, received sync frames can include the MPV 560, the SPV561, and the DPV 562 of FIG. 5C. In some embodiments, the device 202 candetermine whether to transmit or suppress transmission of additionalsync frames in accordance with Table 2, below.

TABLE 2 Received DPV Received DPV Received DPV Higher than Equal toCurrent Lower than Current DPV DPV Current DPV Received MPV SuppressSuppress Transmit Higher than Current MPV Received MPV Suppress TransmitTransmit Equal to Current MPV Received MPV Suppress Transmit TransmitLower than Current MPV

Thus, if the device 202 has received a sync frame having a higher DPVduring the current discovery interval, the device can act as anon-master node. Accordingly, the device 202 can refrain fromtransmitting additional sync frames at block 1210. The device 202 canrefrain from transmitting additional sync frames until at least the nextdiscovery interval.

Moreover, if the device 202 has received a sync frame having an equalDPV during the current discovery interval, the device 202 can determinewhether the sync frame also includes a higher MPV than the MPV of thedevice 202. If the received sync frame has an equal DPV, and a higherMPV, the device 202 can refrain from transmitting additional sync framesat block 1210. The device 202 can refrain from transmitting additionalsync frames until at least the next discovery interval.

A person having ordinary skill in the art will appreciate thatalternative MPV schemes can be used. In an exemplary alternative scheme,when the received DPV is equal to the current DPV, and the received MPVis equal to the current DPV, the device 202 can refrain fromtransmitting additional sync frames at block 1210. The device 202 canrefrain from transmitting additional sync frames until at least the nextdiscovery interval. In some embodiments, the device 202 can determinethat a transmitting node cannot hear transmissions from the device 202based on having received a sync frame from the transmitting node with anequal MPV.

In another alternative MPV scheme, the device 202 can determine whetherit has received a sync frame with an MPV greater than the MPV of thedevice 202. If a received MPV is greater than the MPV of the device 202,the device 202 can refrain from transmitting additional sync frames atblock 1210. The device 202 can refrain from transmitting additional syncframes until at least the next discovery interval.

Then, at block 1220, when the device 202 has not received a sync framefrom a device with a higher DPV, or an equal DPV and a higher MPV, thedevice 202 can act as a master node at block 1220. Accordingly, thedevice 202 can transmit a sync frame during one or more TBTTs and/orbeacon windows in the current discovery interval. In some embodiments,the device 202 can transmit a sync frame during every TBTT and/or beaconwindow until at least the next discovery window. During the nextdiscovery window, the device 202 can re-initiate the contention processdescribed in the flowchart 1100 of FIG. 11. Accordingly, master nodescan be determined more fairly because they can have an opportunity tochange at each discovery window.

In some embodiments, the device 202 can continue to monitor transmissionof sync frames, for example at each subsequent TBTT and/or beaconwindow. If the device 202 sees another sync frame associated with ahigher DPV, or an equal DPV and a higher MPV, the device 202 canrecharacterize as a non-master node. Accordingly, the device 202 canrefrain from transmitting additional sync frames at block 1210.

FIG. 13 shows a flowchart 1300 for an exemplary method of wirelesscommunication that can be employed within the wireless communicationsystem 100 of FIG. 1. The method can be implemented in whole or in partby the devices described herein, such as the wireless device 202 shownin FIG. 2. Although the illustrated method is described herein withreference to the wireless communication system 100 discussed above withrespect to FIG. 1, and the wireless device 202 discussed above withrespect to FIG. 2, a person having ordinary skill in the art willappreciate that the illustrated method can be implemented by anotherdevice described herein, or any other suitable device. Although theillustrated method is described herein with reference to a particularorder, in various embodiments, blocks herein can be performed in adifferent order, or omitted, and additional blocks can be added.

First, at block 1302, the device 202 initiates a contention basedprocess for transmitting a synchronization message during a discoverytime interval of a discovery time period. The synchronization messageincludes a first timestamp of the wireless communication apparatus. Forexample, the device 202 can contend for a transmission slot during theTBTT of the discovery window DW (FIG. 7).

In an embodiment, the device 202 can selectively prepare asynchronization message for transmission during the discovery timeinterval based on a probability value corresponding to a frequency forpreparing the synchronization message over a plurality of discovery timeperiods. For example, the device 202 can selectively prepare (orselectively transmit, selectively refrain from transmitting, orselectively refrain from preparing) a synchronization message asdiscussed above with respect to block 1101 of FIG. 11 and Equations 1-3.

Next, at block 1304, the device 202 selectively transmits thesynchronization message based on a master preference value of thewireless communication apparatus. For example, the device 202 cantransmit the message 1000 (FIG. 10) during the TBTT of the discoverywindow DW (FIG. 7) based on the MPV of the device 202. As discussedabove, with respect to FIG. 10, the device 202 can compare its MPV tothe MPV associated with sync frames received from other devices. Thedevice 202 can transmit its sync frame if it does not see a sync frameassociated with a higher DPV, or an equal DPV and a higher MPV, and canrefrain from transmitting its sync frame if it does see a sync frameassociated with a higher DPV, or an equal DPV and a higher MPV. In anembodiment, the MPV can be associated with sync frames through inclusionin a capability field of each sync frame.

In an embodiment, the MPV can include an anchor flag, a sync time ageindicator, a hop indicator, and a preference indicator. In anembodiment, the anchor flag can include one bit, the sync time ageindicator can include three bits, the hop indicator can include threebits, and the preference indicator can include four bits. For example,the MPV can include the MPV 550 and/or 560 described above with respectto FIGS. 5B-C.

In an embodiment, the device 202 can assert the anchor flag when thewireless communication apparatus is an anchor node. For example, thedevice 202 can determine whether it is an anchor node. The device 202can assert the anchor flag when the device 202 is an anchor node. Thedevice 202 can unassert the anchor flag when the device 202 is not ananchor node (including, for example, when the device 202 is in anon-anchored network).

In an embodiment, the device 202 can set the sync time age indicator toall ones when the wireless communication apparatus is an anchor node.The device 202 can set the sync time age indicator to all zeroes whenthe wireless communication apparatus is in a non-anchored network. Thedevice 202 can otherwise set the sync time age indicator to the greaterof zero and a sync time age indicator of a synchronization node minus anumber of discover windows that have elapsed since a synchronizationwith the synchronization node.

In an embodiment, the device 202 can set the hop indicator to all oneswhen the wireless communication apparatus is an anchor node or hasreceived a message from an anchor node. The device 202 can set the hopindicator to all zeroes when the wireless communication apparatus is ina non-anchored network. The device 202 can otherwise set the hopindicator to the greater of zero and a highest observed hop indicatorminus one.

In an embodiment, the device 202 can set the preference indicator basedon one or more characteristics of the wireless communication apparatus.For example, the device 202 can determine one or more characteristicssuch as, for example, an RF characteristic (e.g., link speed, signalstrength, etc.), a power source, a power consumption rate, a remainingbattery power, a clock type, a clock accuracy, a processor load, a userinteraction, a preset value, etc.

In an embodiment, the device 202 can receive one or more receivedsynchronization messages associated with one or more master preferencevalues. The device 202 can refrain from transmitting the synchronizationmessage when at least one received synchronization message is associatedwith a master preference value greater than or equal to the masterpreference value of the wireless communication apparatus and a discoverypreference value greater than or equal to a discovery preference valueof the wireless communication apparatus. In an embodiment, the device202 can update a time value of a clock signal of the device 202 to avalue derived from the received synchronization messages.

In an embodiment, the device 202 can selectively transmit, during atleast one subsequent transmission time, one or more additionalsynchronization messages when the apparatus has transmitted asynchronization message during the discovery time interval and notreceived a synchronization message associated with a discoverypreference value higher than a discovery preference value of thewireless communication apparatus, or a discovery preference value equalto the discovery preference value of the wireless communicationapparatus and a master preference value higher than the masterpreference value of the wireless communication apparatus. For example,the device 202 can selectively transmit the message 1000 (FIG. 10)during one or more TBTTs or beacon windows the discovery period DP (FIG.7).

In an embodiment, the device 202 can selectively prepare thesynchronization message for transmission based on a probability valuecorresponding to a frequency for preparing the synchronization messageover a plurality of discovery time periods. The device 202 can canceltransmission of the synchronization message in response to receiving asynchronization messages associated with a master preference value equalor greater to a master preference value of the wireless communicationapparatus. In an embodiment, the received synchronization messages caninclude received timestamps. The device 202 can update the time value tothe single received timestamp in response to determining the singlereceived timestamp is greater than a first timestamp.

In an embodiment, the device 202 can update the time value of thewireless communication apparatus by updating the time value to a maximumof the received timestamps. In an embodiment, the device 202 candetermine the probability value based on one or more of: a number ofdevices in a neighborhood aware network and a number of devices seen bythe wireless communication apparatus.

In an embodiment, the device 202 can set a master preference value ofthe wireless communication apparatus to a minimum value when thewireless communication apparatus does not support a master electionprocess. In an embodiment, the device 202 can determine one or morecontention parameters based on the master preference value. In anembodiment, the wireless device 202 can selectively transmit additionalsynchronization messages until the next discovery interval. In anembodiment, one or more synchronization messages can include the masterpreference value.

In an embodiment, the method shown in FIG. 13 can be implemented in awireless device that can include an initiating circuit and atransmitting circuit. Those skilled in the art will appreciate that awireless device can have more components than the simplified wirelessdevice described herein. The wireless device described herein includesonly those components useful for describing some prominent features ofimplementations within the scope of the claims.

The initiating circuit can be configured to initiate the contentionbased process. The initiating circuit can be configured to perform atleast block 1302 of FIG. 13. The determining circuit can include one ormore of the processor 204 (FIG. 2), the memory 206 (FIG. 2), transmitter210 (FIG. 2), the receiver 212 (FIG. 2), the antenna 216 (FIG. 2), andthe transceiver 214 (FIG. 2). In some implementations, means fordetermining can include the determining circuit.

The transmitting circuit can be configured to selectively transmit thesynchronization message. The transmitting circuit can be configured toperform at least block 1304 of FIG. 13. The transmitting circuit caninclude one or more of the transmitter 210 (FIG. 2), the antenna 216(FIG. 2), and the transceiver 214 (FIG. 2). In some implementations,means for transmitting can include the transmitting circuit.

In NAN systems such as described above, it can also be advantageous toreduce the amount of time that the networked devices are in an awakeactive mode for the communications that occur during the discoverywindows 402. As the devices are often battery powered, this can helplower power consumption and extend battery life.

The clock oscillators in these devices generally have a nominal clockrate along with a tolerance range within which the clock rate isessentially guaranteed to remain over temperature variations, aging, andthe like, such as 1 MHz nominal rate ±20 ppm. Because each clock rate ofeach device may vary within its tolerance range, time synchronizationbetween the devices will be lost between the successive synchronizationoperations performed during successive discovery windows 402. This isillustrated in FIG. 14.

FIG. 14 shows a timeline 1412 with two successive discovery windows 402a and 402 b. Each discovery window has a nominal duration of T_(DWN),and the successive discovery windows 402 a, 402 b are separated by adiscovery period 406 having a nominal duration of T_(DPN). The nominaldurations T_(DWN) and T_(DPN) are established as essentially fixedparameters of the NAN. During the first discovery window 402 a, alldevices of the NAN are active, and a master device establishes anabsolute time reference point for all devices in the NAN. Once thisoccurs and the discovery window 402 a ends, some or all of the devicesof the NAN may transition to a low power sleep mode. As time passes, onesecond or more for example, to the next discovery window 402 b, thedifferent clock rates in the different devices of the NAN cause theabsolute time in the devices (measured as clock transitions of the clockin each different device of the NAN) to drift apart from one another.However, all of the devices must again become active for the nextdiscovery window 402 b. It is beneficial if the waking up time periodfor the discovery period 402 b is as short as possible.

FIG. 15 illustrates the timeline of FIG. 14 in the region of the seconddiscovery period 402 b. In this Figure, the time drift of device N ofthe NAN is referred to as DriftN, and is the maximum amount of absolutetime deviation device N can experience over the time period T_(DPN). Forexample, if T_(DPN) is one second, and the clock is a 1 MHz clock withtolerance ±20 ppm, then DriftN is 20 microseconds. In the implementationof FIG. 15, each device of the NAN (referred to generically herein as“device N”) that is in a sleep mode prior to the discovery window 402 bmay calculate an expected time for the start of discovery window 402 b,which is designates T₃ in FIG. 15. For example, if T_(DPN) is onesecond, and device N has a 1 MHz nominal clock rate, time T₃ will be onemillion internal clock transitions from the start of discovery window402 a. However, because other devices on the NAN may have faster clocks,each device N may be configured transition to an active state prior tothis point so that it is active to receive any discovery windowtransmissions produced by other devices of the NAN.

To guarantee it is in an awake state for any such transitions, but tominimize the total amount of awake time, device N may transition to anactive state at time T₁ of FIG. 15. This is a point that is equal totime T₃ minus the sum (DriftN+DriftM), where DriftM is the drift of thedevice of the NAN with the largest drift, which may correspond to thedevice of the NAN having the largest clock rate tolerance. In manycases, a networking standard such as one or more of the IEEE 802.11family will specify clock tolerances for members of a network, andDriftN will be equal to DriftM, but this need not be the case. In somecases, the clock rate tolerance and thus the drift of different devicesof the NAN may be different. The devices of the NAN may communicatetheir clock parameters to each other, such that each device will knowboth its own drift, and the drift of other devices in the NAN. In onepossible implementation, a synchronization message such as shown in FIG.10 can include clock parameters for the sending device. As the identityof the master device is negotiated during discovery windows 402, themembers of the NAN can collect information about the drift of thevarious NAN members through these messages. If this information is notavailable for some NAN members, a clock tolerance standard may specify alargest compliant tolerance, and the members of the NAN may assume thata given other device is operating at this highest tolerance when it hasno information about the clock parameters of that device.

The above example assumes that clock tolerances are set forth in anetworking standard, but it would also be possible to specify driftparameters directly in a networking standard. For example, if T_(DPN) isspecified in the networking standard, a drift parameter in units of timemay be part of the standard as well, defining a DriftN value directlyfor all compliant members of a NAN. Manufacturers of standard compliantdevices may satisfy the standard in a variety of ways, but would ensurethat the timing of their devices would not drift larger than the DriftNof the standard over the T_(DPN) of the standard. As with the clockparameters, each device could have an internal DriftN value for itself,which may be different for different devices, but always less than anymaximum specified in the networking standard. These individual DriftNvalues could be communicated between members of the NAN as describedabove.

Although device N may be prepared to receive discovery windowtransmissions starting at time T₁, it may be configured to refrain frommaking any discovery window transmissions itself until time T₃. This isbecause during the period between time T₁ and T₃, some devices of theNAN with slower clocks than device N may not be in an awake mode yet.Thus, device N will only transmit after time T₃.

Device N may then continue to transmit and/or receive discovery windowmessages until time T₄, which is T_(DWN) after time T₃. At this point,device N will cease transmissions, because devices with faster clocksmay begin to go to sleep at time T₄. However, device N will continue inan active state until time T₂ to listen for further discovery windowtransmissions from devices with slower clocks. Similar to the timeperiod between times T₁ and T₃, the time period between times T₄ and T₂is the sum of DriftN plus DriftM. At time T₂, device N may transitionback to a low power sleep mode. If each of the devices of the NANfollows this procedure, every device will be active to receivetransmissions from every other device, and each device of the NAN willonly transmit when all of the other devices are in an active state andlistening for discovery window transmissions. The total time that eachdevice N is awake for this process is T_(DW) plus twice the sum ofDrift1 plus Drift2. The duration of the actual discovery window,designated T_(DWA) in FIG. 15, which may be defined as the time periodbetween the earliest possible discovery window transmission from a NANmember at time T₁ to the last possible discovery window transmissionfrom a NAN member at time T₂ is equal to T_(DWN) plus twice the sum ofDriftN_(max) plus DriftM, where DriftN_(max) is the drift of the NANdevice, other than device M, with the largest clock tolerance. For thesimple and most easily implemented design, the clock tolerances or otherdrift parameter(s), and therefore drifts, of all the devices are thesame, and T_(DWA) will be equal to T_(DWN) plus four times DriftN.

FIG. 16 also illustrates the timeline of FIG. 14 in the region of thesecond discovery period 402 b, and illustrates a second implementationof a sleep to awake mode transition timing protocol for members of aNAN. As described above, a NAN system may operate where during eachdiscovery window, one member of the NAN is selected as a master deviceresponsible for sending beacons during the discovery period betweendiscovery windows. During the discovery window in which this masterdevice is selected, the other devices of the NAN synchronize theirinternal times using information provided by this selected master unit.

In the implementation of FIG. 16, this master unit may determine its ownestimated time for the start of the next discovery window. When thistime is reached, according to the internal clocking of the masterdevice, the master device may send an additional discovery window startframe 1612 to the other devices of the NAN. The other devices of the NANuse this received start frame to initiate their own discovery windowoperations of receiving and transmitting discovery window messages asdescribed above. The format of the discovery window start frame 1612 mayvary. For example, it may be a beacon frame with a flag bit or fieldindicating it is a start frame, or a clear to send (CTS) frame with aNAN identification field.

As illustrated in FIG. 16, the discovery window start frame 1612 is sentat time T₃, which is the master unit's estimated time for the start ofthe discovery frame 402 b. This time may be determined by the masterunit by using its own internal clock to measure the time T_(DP) asestablished in the NAN from the beginning of the last discovery window402 a.

At time T₃, upon receipt of the discovery window start frame 1612, themembers of the NAN initiate discovery window communications, andcontinue this process until time T₂, which is calculated by each memberof the NAN as a duration of T_(DWN) (as also established by the NAN)following time T₃.

Each member of the NAN should be awake at time T₃ when the currentmaster sends the discovery window start frame 1612. Due to the clockdrift described above, each device (again generically referred to as“device N”) may generate its own internal estimate of the expected starttime of the discovery window 402 b, corresponding in FIG. 16 with timeT₄. If the current master has a faster clock than the device N, thestart frame 1612 may be sent earlier than this however. To ensure thatit is awake when the current master sends the start frame 1612, device Nmay transition from a sleep mode to an awake active mode at time T₁,where T₁ is calculated as estimated time T₄ minus the sum(DriftN+DriftM), where in FIG. 16 DriftM is the drift of the currentmaster device.

Because the current master may have either a slower clock or a fasterclock than device N, the start frame 1612 will be received in a timewindow between times T₁ and T₅, which has a width of 2DriftN plus2DriftM. If device N has the slowest clock, and device M has the fastestclock, the discovery window start frame 1612 will be receivedimmediately after device N transitions to an awake state at or near timeT₁, and the total awake time for device N will be essentially equal toT_(DWN). If device N has the fastest clock, and device M has the slowestclock, the discovery window start frame 1612 will be received at timeT₅, and the total awake time for device N will be T_(DWN) plus two timesthe sum (DriftN+DriftM). The average awake time for device N over alarge number of successive discovery windows will be T_(DWN) plus DriftNplus DriftM. This can be an advantage provided by use of the discoverywindow start frame 1612 over the protocol of FIG. 15, since in FIG. 15,the awake time is always T_(DWN) plus two times the sum (DriftN+DriftM),whereas in FIG. 16, this is the maximum necessary awake time, with theaverage time being less than this. This can conserve power for batteryoperated portable devices that are members of the NAN. Another advantageof the discovery window start frame 1612 is that the actual discoverywindow duration T_(DWA), defined as the time between the earliestpossible discovery window message transmission time and the latestpossible discovery window message transmission time, is equal to thenominal network established value of T_(DWN). Thus, the discovery windowwidth is always the same, and only its absolute time position isaffected by drift, specifically by the drift of the current master thatsends the discovery window start frame 1612. This can be useful inreserving time for the discovery window using the NAV, and can be usefulfor coexistence.

In some cases, a given member of the NAN may miss one or more successivediscovery windows, and fail to synchronize its local time value for twoor more periods of T_(DPN). If this occurs, the device may widen itslistening window as it searches for discovery window transmissions toaccount for the additional drift produced by the longer time periodbetween synchronization.

In the implementation of FIG. 15, for example, a device may beconfigured to calculate a wake up time T₁ as T₃ minus(n+1)(DriftN+DriftM), where n is the number of missed discovery windowssince the last discovery window where the device received timesynchronization information, and T₃ is the locally measured time lapse(n+1)T_(DPN). Similarly, the time T₂ can be extended to be T₄ plus(n+1)(DriftN+DriftM), where T₄ is T₃ plus T_(DWN) as usual. If thedevice wakes up for a discovery window and fails to receivesynchronization information, the value of n is incremented by one forthe computation of the next discovery window wake up and sleeptransition times. The value n is reset to zero when a device issuccessfully synchronized during a discovery window.

In the protocol of FIG. 16, the listening window between times T₁ and T₅within which the device expects to receive a discovery window startframe 1612 can be similarly extended to time T₄±(n+1)(DriftN+Drift M),where time T₄ is (n+1)T_(DPN). In this case, the device may transitionback to a sleep mode at time T₅, which will be T₄ plus(n+1)(DriftN+DriftM) if no discovery window start frame is received whenthis time T₅ is reached. If this occurs, n is incremented by one for thecomputation of the awake and sleep times for the next discovery window.

In the above discussion of FIGS. 14, 15, and 16, certain events such astransitioning to an active mode or to a sleep mode, or sending frames ofdata are described as occurring at certain specifically defined times.Of course, exact timing is a practical impossibility, the eventsthemselves may have their own durations from start to completion, and itmay also be useful to further include buffer periods around thedescribed times, such as awakening slightly before time T₁ and enteringa sleep mode slightly after T₂ instead of exactly at these times. Thus,the event times described here are intended to be approximate in nature,in accordance with the desired goals of maintaining timesynchronization, successfully exchanging messages during discoverywindows, and reducing the amount of awake time for the members of theNAN to perform these processes.

It should be understood that any reference to an element herein using adesignation such as “first,” “second,” and so forth does not generallylimit the quantity or order of those elements. Rather, thesedesignations can be used herein as a convenient wireless device ofdistinguishing between two or more elements or instances of an element.Thus, a reference to first and second elements does not mean that onlytwo elements can be employed there or that the first element can precedethe second element in some manner. Also, unless stated otherwise a setof elements can include one or more elements.

A person/one having ordinary skill in the art would understand thatinformation and signals can be represented using any of a variety ofdifferent technologies and techniques. For example, data, instructions,commands, information, signals, bits, symbols, and chips that can bereferenced throughout the above description can be represented byvoltages, currents, electromagnetic waves, magnetic fields or particles,optical fields or particles, or any combination thereof.

A person/one having ordinary skill in the art would further appreciatethat any of the various illustrative logical blocks, modules,processors, means, circuits, and algorithm steps described in connectionwith the aspects disclosed herein can be implemented as electronichardware (e.g., a digital implementation, an analog implementation, or acombination of the two, which can be designed using source coding orsome other technique), various forms of program or design codeincorporating instructions (which can be referred to herein, forconvenience, as “software” or a “software module), or combinations ofboth. To clearly illustrate this interchangeability of hardware andsoftware, various illustrative components, blocks, modules, circuits,and steps have been described above generally in terms of theirfunctionality. Whether such functionality is implemented as hardware orsoftware depends upon the particular application and design constraintsimposed on the overall system. Skilled artisans can implement thedescribed functionality in varying ways for each particular application,but such implementation decisions should not be interpreted as causing adeparture from the scope of the present disclosure.

The various illustrative logical blocks, modules, and circuits describedin connection with the aspects disclosed herein and in connection withFIGS. 1-9 can be implemented within or performed by an integratedcircuit (IC), an access terminal, or an access point. The IC can includea general purpose processor, a digital signal processor (DSP), anapplication specific integrated circuit (ASIC), a field programmablegate array (FPGA) or other programmable logic device, discrete gate ortransistor logic, discrete hardware components, electrical components,optical components, mechanical components, or any combination thereofdesigned to perform the functions described herein, and can executecodes or instructions that reside within the IC, outside of the IC, orboth. The logical blocks, modules, and circuits can include antennasand/or transceivers to communicate with various components within thenetwork or within the device. A general purpose processor can be amicroprocessor, but in the alternative, the processor can be anyconventional processor, controller, microcontroller, or state machine. Aprocessor can also be implemented as a combination of computing devices,e.g., a combination of a DSP and a microprocessor, a plurality ofmicroprocessors, one or more microprocessors in conjunction with a DSPcore, or any other such configuration. The functionality of the modulescan be implemented in some other manner as taught herein. Thefunctionality described herein (e.g., with regard to one or more of theaccompanying figures) can correspond in some aspects to similarlydesignated “means for” functionality in the appended claims.

If implemented in software, the functions can be stored on ortransmitted over as one or more instructions or code on acomputer-readable medium. The steps of a method or algorithm disclosedherein can be implemented in a processor-executable software modulewhich can reside on a computer-readable medium. Computer-readable mediaincludes both computer storage media and communication media includingany medium that can be enabled to transfer a computer program from oneplace to another. A storage media can be any available media that can beaccessed by a computer. By way of example, and not limitation, suchcomputer-readable media can include RAM, ROM, EEPROM, CD-ROM or otheroptical disk storage, magnetic disk storage or other magnetic storagedevices, or any other medium that can be used to store desired programcode in the form of instructions or data structures and that can beaccessed by a computer. Also, any connection can be properly termed acomputer-readable medium. Disk and disc, as used herein, includescompact disc (CD), laser disc, optical disc, digital versatile disc(DVD), floppy disk, and Blu-ray disc where disks usually reproduce datamagnetically, while discs reproduce data optically with lasers.Combinations of the above should also be included within the scope ofcomputer-readable media. Additionally, the operations of a method oralgorithm can reside as one or any combination or set of codes andinstructions on a machine readable medium and computer-readable medium,which can be incorporated into a computer program product.

It is understood that any specific order or hierarchy of steps in anydisclosed process is an example of a sample approach. Based upon designpreferences, it is understood that the specific order or hierarchy ofsteps in the processes can be rearranged while remaining within thescope of the present disclosure. The accompanying method claims presentelements of the various steps in a sample order, and are not meant to belimited to the specific order or hierarchy presented.

Various modifications to the implementations described in thisdisclosure can be readily apparent to those skilled in the art, and thegeneric principles defined herein can be applied to otherimplementations without departing from the spirit or scope of thisdisclosure. Thus, the disclosure is not intended to be limited to theimplementations shown herein, but is to be accorded the widest scopeconsistent with the claims, the principles and the novel featuresdisclosed herein. The word “exemplary” is used exclusively herein tomean “serving as an example, instance, or illustration.” Anyimplementation described herein as “exemplary” is not necessarily to beconstrued as preferred or advantageous over other implementations.

Certain features that are described in this specification in the contextof separate implementations also can be implemented in combination in asingle implementation. Conversely, various features that are describedin the context of a single implementation also can be implemented inmultiple implementations separately or in any suitable sub-combination.Moreover, although features can be described above as acting in certaincombinations and even initially claimed as such, one or more featuresfrom a claimed combination can in some cases be excised from thecombination, and the claimed combination can be directed to asub-combination or variation of a sub-combination.

Similarly, while operations are depicted in the drawings in a particularorder, this should not be understood as requiring that such operationsbe performed in the particular order shown or in sequential order, orthat all illustrated operations be performed, to achieve desirableresults. In certain circumstances, multitasking and parallel processingcan be advantageous. Moreover, the separation of various systemcomponents in the implementations described above should not beunderstood as requiring such separation in all implementations, and itshould be understood that the described program components and systemscan generally be integrated together in a single software product orpackaged into multiple software products. Additionally, otherimplementations are within the scope of the following claims. In somecases, the actions recited in the claims can be performed in a differentorder and still achieve desirable results.

What is claimed is:
 1. A method of synchronizing a wirelesscommunication apparatus, the method comprising: receiving one or moresynchronization messages, each synchronization message having timinginformation and a cluster identifier, the timing information comprisinganchor timing information, the cluster identifier being the same valueas a cluster identifier of the apparatus; determining whether adifference between a time value when a received synchronization messagelast received anchor timing information and a time value maintained forthe apparatus is greater than a threshold; and discarding the receivedsynchronization message if the difference exceeds the threshold.
 2. Themethod of claim 1, further comprising selectively updating a time valueof the wireless apparatus based on the timing information in thereceived one or more synchronization messages.
 3. The method of claim 2,wherein selectively updating comprises: determining whether a differencebetween a time value in the timing information of a receivedsynchronization message and a time maintained by the apparatus isgreater than a threshold; and discarding the received synchronizationmessage if the difference exceeds the threshold.
 4. The method of claim2, wherein selectively updating comprises: determining whether adifference between a time value in the timing information of a receivedsynchronization message and the mean time value in the timinginformation of the other one or more received synchronization messagesis greater than a threshold; and discarding the received synchronizationmessage if the difference exceeds the threshold.
 5. The method of claim2, wherein selectively updating the time value of the wirelesscommunication apparatus comprises updating the time value to a timevalue of a received synchronization message with a master preferencevalue greater than master preference values of the other one or morereceived synchronization messages.
 6. The method of claim 5, whereinselectively updating further comprises updating the time value based ona device identifier of the one or more received synchronization messageswhen more than one received synchronization messages have the samemaster preference value.
 7. The method of claim 6, wherein the deviceidentifier comprises a medium access control address.
 8. The method ofclaim 5, wherein selectively updating further comprises updating thetime value to a time value of a received synchronization message with atime value greater than time values of the other one or more receivedsynchronization messages when more than one received synchronizationmessages have the same master preference value.
 9. The method of claim2, wherein selectively updating the time value of the wirelesscommunication apparatus comprises updating the time value to a maximumtime value of the timing information of the one or more receivedsynchronization messages.
 10. The method of claim 2, wherein selectivelyupdating the time value of the wireless communication apparatuscomprises updating the time value to one of a mean time value, a minimumtime value, or a median time value of the timing information of the oneor more received synchronization messages.
 11. The method of claim 2,wherein selectively updating the time value of the communicationapparatus comprises updating the time value to a time value in thetiming information of a received synchronization message with the mostrecent anchor timing information of the one or more receivedsynchronization messages.
 12. The method of claim 2, further comprisingdetermining whether the apparatus has received timing information froman anchor node, wherein selectively updating the time value of thewireless communication apparatus comprises updating the time value to amaximum time value of the timing information of the one or more receivedsynchronization messages when the apparatus has not received timinginformation from the anchor node.
 13. A wireless communication apparatusconfigured for wireless network synchronization, the apparatuscomprising: a receiver configured to receive one or more synchronizationmessages, each synchronization message having timing information and acluster identifier, the timing information comprising anchor timinginformation, the cluster identifier being the same value as a clusteridentifier of the apparatus; and a processor configured to determinewhether a difference between a time value when a receivedsynchronization message last received anchor timing information and atime value maintained by the processor is greater than a threshold, theprocessor further configured to discard the received synchronizationmessage if the difference exceeds the threshold.
 14. The apparatus ofclaim 13, the processor further configured to selectively update a timevalue maintained by the processor based on the timing information in thereceived one or more synchronization messages.
 15. The apparatus ofclaim 14, wherein the processor is further configured to selectivelyupdate the time value by: determining whether a difference between atime value in the timing information of a received synchronizationmessage and a time maintained by the apparatus is greater than athreshold; and discarding the received synchronization message if thedifference exceeds the threshold.
 16. The apparatus of claim 14, whereinthe processor is further configured to selectively update the time valueby: determining whether a difference between a time value in the timinginformation of a received synchronization message and the mean timevalue in the timing information of the other one or more receivedsynchronization messages is greater than a threshold; and discarding thereceived synchronization message if the difference exceeds thethreshold.
 17. The apparatus of claim 14, wherein the processor isfurther configured to selectively update the time value by updating thetime value to a time value of a received synchronization message with amaster preference value greater than master preference values of theother one or more received synchronization messages.
 18. The apparatusof claim 17, wherein the processor is further configured to selectivelyupdate the time value by updating the time value based on a deviceidentifier of the one or more received synchronization messages whenmore than one received synchronization messages have the same masterpreference value.
 19. The apparatus of claim 18, wherein the deviceidentifier comprises a medium access control address.
 20. The apparatusof claim 17, wherein the processor is further configured to selectivelyupdate the time value by updating the time value to a time value of areceived synchronization message with a time value greater than timevalues of the other one or more received synchronization messages whenmore than one received synchronization messages have the same masterpreference value.
 21. The apparatus of claim 14, wherein the processoris further configured to selectively update the time value by updatingthe time value to a maximum time value of the timing information of theone or more received synchronization messages.
 22. The apparatus ofclaim 14, wherein the processor is further configured to selectivelyupdate the time value by updating the time value to one of a mean timevalue, a minimum time value, or a median time value of the timinginformation of the one or more received synchronization messages. 23.The apparatus of claim 14, wherein the processor is further configuredto selectively update the time value by updating the time value to atime value in the timing information of a received synchronizationmessage of the one or more received synchronization messages with themost recent anchor timing information.
 24. The apparatus of claim 14,wherein the processor is further configured determine whether theapparatus has received timing information from an anchor node and isfurther configured to selectively update the time value by updating thetime value to a maximum time value of the timing information of the oneor more received synchronization messages when the receiver has notreceived timing information from the anchor node.
 25. A wirelesscommunication apparatus configured for wireless network synchronization,the apparatus comprising: means for receiving one or moresynchronization messages, each synchronization message having timinginformation and a cluster identifier, the timing information comprisinganchor timing information, the cluster identifier being the same valueas a cluster identifier of the apparatus; means for determining whethera difference between a time value when a received synchronizationmessage last received anchor timing information and a time valuemaintained for the apparatus is greater than a threshold; and means fordiscarding the received synchronization message if the differenceexceeds the threshold.
 26. The apparatus of claim 25, further comprisingmeans for selectively updating a time value of the wireless apparatusbased on the timing information in the received one or moresynchronization messages.
 27. The apparatus of claim 26, wherein meansfor selectively updating is configured to selectively update the timevalue by: determining whether a difference between a time value in thetiming information of a received synchronization message and a timemaintained by the apparatus is greater than a threshold; and discardingthe received synchronization message if the difference exceeds thethreshold.
 28. The apparatus of claim 26, wherein means for selectivelyupdating is configured to selectively update the time value by:determining whether a difference between a time value in the timinginformation of a received synchronization message and the mean timevalue in the timing information of the other one or more receivedsynchronization messages is greater than a threshold; and discarding thereceived synchronization message if the difference exceeds thethreshold.
 29. The apparatus of claim 26, wherein means for selectivelyupdating is configured to selectively update the time value by updatingthe time value to a time value of a received synchronization messagewith a master preference value greater than master preference values ofthe other one or more received synchronization messages when more thanone received synchronization messages have the same master preferencevalue.
 30. The apparatus of claim 29, wherein means for selectivelyupdating is configured to selectively update the time value by updatingthe time value based on a device identifier of the one or more receivedsynchronization messages.
 31. The apparatus of claim 30, wherein thedevice identifier comprises a medium access control address.
 32. Theapparatus of claim 29, wherein means for selectively updating isconfigured to selectively update the time value by updating the timevalue to a time value of a received synchronization message with a timevalue greater than time values of the other one or more receivedsynchronization messages when more than one received synchronizationmessages have the same master preference value.
 33. The apparatus ofclaim 26, wherein means for selectively updating is configured toselectively update the time value by updating the time value to amaximum time value of the timing information of the one or more receivedsynchronization messages.
 34. The apparatus of claim 26, wherein meansfor selectively updating is configured to selectively update the timevalue by updating the time value to one of a mean time value, a minimumtime value, or a median time value of the timing information of the oneor more received synchronization messages.
 35. The apparatus of claim26, wherein means for selectively updating the time value of theapparatus comprises means for updating the time value to a time value inthe timing information of a received synchronization message of the oneor more received synchronization messages with the most recent anchortiming information.
 36. The apparatus of claim 26, further comprisingmeans for determining whether the apparatus has received timinginformation from an anchor node, wherein means for selectively updatingis configured to selectively update the time value by updating the timevalue to a maximum time value of the timing information of the one ormore received synchronization messages when the apparatus has notreceived timing information from the anchor node.
 37. A non-transitorycomputer-readable medium comprising code that, when executed, causes aprocessor of a wireless communication apparatus to: receive one or moresynchronization messages, each synchronization message having timinginformation and a cluster identifier, the timing information comprisinganchor timing information, the cluster identifier being the same valueas a cluster identifier of the apparatus; determine whether a differencebetween a time value when a received synchronization message lastreceived anchor timing information and a time value maintained for theapparatus is greater than a threshold; and discard the receivedsynchronization message if the difference exceeds the threshold.
 38. Themedium of claim 37, further comprising code that, when executed, causesa processor of a wireless communication apparatus to selectively updatea time value of the wireless apparatus based on the timing informationin the received one or more synchronization messages.
 39. The medium ofclaim 38, wherein the processor is configured to selectively update thetime value by: determining whether a difference between a time value inthe timing information of a received synchronization message and a timemaintained by the apparatus is greater than a threshold; and discardingthe received synchronization message if the difference exceeds thethreshold.
 40. The medium of claim 38, wherein the processor isconfigured to selectively update the time value by: determining whethera difference between a time value in the timing information of areceived synchronization message and the mean time value in the timinginformation of the other one or more received synchronization messagesis greater than a threshold; and discarding the received synchronizationmessage if the difference exceeds the threshold.
 41. The medium of claim38, wherein the processor is configured to selectively update the timevalue by updating the time value to a time value of a receivedsynchronization message with a master preference value greater thanmaster preference values of the other one or more receivedsynchronization messages when more than one received synchronizationmessages have the same master preference value.
 42. The medium of claim41, wherein the processor is configured to selectively update the timevalue by updating the time value based on a device identifier of the oneor more received synchronization messages.
 43. The medium of claim 42,wherein the device identifier comprises a medium access control address.44. The medium of claim 41, wherein the processor is configured toselectively update the time value by updating the time value to a timevalue of a received synchronization message with a time value greaterthan time values of the other one or more received synchronizationmessages when more than one received synchronization messages have thesame master preference value.
 45. The medium of claim 38, wherein theprocessor is configured to selectively update the time value by updatingthe time value to a maximum time value of the timing information of theone or more received synchronization messages.
 46. The medium of claim38, wherein the processor is configured to selectively update the timevalue by updating the time value to one of a mean time value, a minimumtime value, or a median time value of the timing information of the oneor more received synchronization messages.
 47. The medium of claim 38,wherein the processor is configured to selectively update the time valueby updating the time value to a time value in the timing information ofa received synchronization message of the one or more receivedsynchronization messages with the most recent anchor timing information.48. The medium of claim 38, further comprising code that, when executed,causes a processor of a wireless communication apparatus to determinewhether the apparatus has received timing information from an anchornode, wherein the processor is configured to selectively update the timevalue by updating the time value to a maximum time value of the timinginformation of the one or more received synchronization messages whenthe apparatus has not received timing information from the anchor node.